The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Makespan with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1981-1993 (18) 1994-1996 (18) 1997-1998 (28) 1999 (17) 2000 (28) 2001 (21) 2002 (36) 2003 (39) 2004 (77) 2005 (85) 2006 (97) 2007 (88) 2008 (111) 2009 (100) 2010 (48) 2011 (35) 2012 (54) 2013 (43) 2014 (50) 2015 (54) 2016 (51) 2017 (60) 2018 (50) 2019 (53) 2020 (58) 2021 (56) 2022 (58) 2023 (72) 2024 (15)
Publication types (Num. hits)
article(880) incollection(3) inproceedings(634) phdthesis(3)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 725 occurrences of 302 keywords

Results
Found 1520 publication records. Showing 1520 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
14Jingying Huang, Liya Wang, Zhibin Jiang A method combining rules with genetic algorithm for minimizing makespan on a batch processing machine with preventive maintenance. Search on Bibsonomy Int. J. Prod. Res. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Vaneet Aggarwal, Ruijiu Mao Preemptive scheduling for approximate computing on heterogeneous machines: Tradeoff between weighted accuracy and makespan. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Muberra Allahverdi, Ali Allahverdi Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan. Search on Bibsonomy RAIRO Oper. Res. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Harendra Kumar, Shailendra Giri Optimisation of makespan of a flow shop problem using multi layer neural network. Search on Bibsonomy Int. J. Comput. Sci. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Pengwei Wang 0001, Yinghui Lei, Promise Ricardo Agbedanu, Zhaohui Zhang Makespan-Driven Workflow Scheduling in Clouds Using Immune-Based PSO Algorithm. Search on Bibsonomy IEEE Access The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Guanqun Ni, Lei Chen Improved Scheduling for the Three-Machine Proportionate Open Shop and Mixed Shop Minimum Makespan Problems. Search on Bibsonomy IEEE Access The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Yanming Fu, Zhuohang Li, Ningjiang Chen, Chiwen Qu A Discrete Multi-Objective Rider Optimization Algorithm for Hybrid Flowshop Scheduling Problem Considering Makespan, Noise and Dust Pollution. Search on Bibsonomy IEEE Access The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Zigao Wu, Shudong Sun, Shaohua Yu Optimizing makespan and stability risks in job shop scheduling. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Sadiqi Assia, Ikram El Abbassi, Abdellah Elbarkany, Moumen Darcherif, Ahmed El Biyaali Green Scheduling of Jobs and Flexible Periods of Maintenance in a Two-Machine Flowshop to Minimize Makespan, a Measure of Service Level and Total Energy Consumption. Search on Bibsonomy Adv. Oper. Res. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14R. Vijayalakshmi, V. Vasudevan, Seifedine Nimer Kadry, R. Lakshmana Kumar Optimization of makespan and resource utilization in the fog computing environment through task scheduling algorithm. Search on Bibsonomy Int. J. Wavelets Multiresolution Inf. Process. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Ali Allahverdi, Harun Aydilek, Asiye Aydilek No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan. Search on Bibsonomy Appl. Math. Comput. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Daniel R. Page, Roberto Solis-Oba Makespan minimization on unrelated parallel machines with a few bags. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Daniel R. Page, Roberto Solis-Oba, Marten Maack Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Sven O. Krumke, Le Huy Minh Robust absolute single machine makespan scheduling-location problem on trees. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Oliver Bachtler, Sven O. Krumke, Le Huy Minh Robust single machine makespan scheduling with release date uncertainty. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Guiliang Gong, Raymond Chiong, Qianwang Deng, Qiang Luo A memetic algorithm for multi-objective distributed production scheduling: minimizing the makespan and total energy consumption. Search on Bibsonomy J. Intell. Manuf. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Xiumin Zhou, Gongxuan Zhang, Tian Wang, Mingyue Zhang, Xiji Wang, Wei Zhang Makespan-Cost-Reliability-Optimized Workflow Scheduling Using Evolutionary Techniques in Clouds. Search on Bibsonomy J. Circuits Syst. Comput. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Jing Huang 0012, Renfa Li, Xun Jiao, Yu Jiang 0001, Wanli Chang 0001 Dynamic DAG Scheduling on Multiprocessor Systems: Reliability, Energy, and Makespan. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Saeid Alirezazadeh, Luís A. Alexandre Improving Makespan in Dynamic Task Allocation for Cloud Robotic Systems with Time Window Constraints. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
14Debasis Dwibedy, Rakesh Mohanty Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
14Jan Dvorák, Martin Heller, Zdenek Hanzálek Makespan minimization of Time-Triggered traffic on a TTEthernet network. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
14Janardhan Kulkarni, Shi Li 0001, Jakub Tarnawski, Minwei Ye Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
14Anupam Gupta 0001, Amit Kumar 0001, Viswanath Nagarajan, Xiangkun Shen Stochastic Makespan Minimization in Structured Set Systems. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
14Ali Asghari, Mohammad Karim Sohrabi, Farzin Yaghmaee Online scheduling of dependent tasks of cloud's workflows to enhance resource utilization and reduce the makespan using multiple reinforcement learning-based agents. Search on Bibsonomy Soft Comput. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Hande Öztop, Mehmet Fatih Tasgetiren, Levent Kandiller, Deniz Türsel Eliiyi, Liang Gao 0001 Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption. Search on Bibsonomy Swarm Evol. Comput. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Klaus Jansen, Kim-Manuel Klein, José Verschae Closing the Gap for Makespan Scheduling via Sparsification Techniques. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Morteza Davari, Mohammad Ranjbar, Patrick De Causmaecker, Roel Leus Minimizing makespan on a single machine with release dates and inventory constraints. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Tae-Sun Yu, Michael L. Pinedo Flow shops with reentry: Reversibility properties and makespan optimal schedules. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Ibrahim Muter Exact algorithms to minimize makespan on single and parallel batch processing machines. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Victor Verdugo, José Verschae, Andreas Wiese Breaking symmetries to rescue sum of squares in the case of makespan scheduling. Search on Bibsonomy Math. Program. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Antonio Costa 0001, F. V. Cappadonna, Sergio Fichera Minimizing makespan in a Flow Shop Sequence Dependent Group Scheduling problem with blocking constraint. Search on Bibsonomy Eng. Appl. Artif. Intell. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Ansis Ozolins A new exact algorithm for no-wait job shop problem to minimize makespan. Search on Bibsonomy Oper. Res. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Paz Perez-Gonzalez, Victor Fernandez-Viagas, Jose M. Framiñan Permutation flowshop scheduling with periodic maintenance and makespan objective. Search on Bibsonomy Comput. Ind. Eng. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Shijin Wang 0002, Ruochen Wu, Feng Chu 0001, Jianbo Yu, Xin Liu 0025 An improved formulation and efficient heuristics for the discrete parallel-machine makespan ScheLoc problem. Search on Bibsonomy Comput. Ind. Eng. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Nir Halman A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times. Search on Bibsonomy J. Sched. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Cheng He, Chunqi Xu, Hao Lin Serial-batching scheduling with two agents to minimize makespan and maximum cost. Search on Bibsonomy J. Sched. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Christophe Sauvey, Nathalie Sauer Two NEH Heuristic Improvements for Flowshop Scheduling Problem with Makespan Criterion. Search on Bibsonomy Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Yuri N. Sotskov, Natalja M. Matsveichuk, Vadzim D. Hatsura Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations. Search on Bibsonomy Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Lisi Cao, Jianhong Hao, Dakui Jiang Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan. Search on Bibsonomy Complex. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Dawei Li, Xiwen Lu Two-machine flow shop scheduling with an operator non-availability period to minimize makespan. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Jin Sun 0001, Lu Yin 0005, Minhui Zou, Yi Zhang 0025, Tianqi Zhang, Junlong Zhou Makespan-minimization workflow scheduling for complex networks with social groups in edge computing. Search on Bibsonomy J. Syst. Archit. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Anupam Gupta 0001, Amit Kumar 0001, Viswanath Nagarajan, Xiangkun Shen Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract). Search on Bibsonomy IPCO The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Janardhan Kulkarni, Shi Li 0001, Jakub Tarnawski, Minwei Ye Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints. Search on Bibsonomy SODA The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Damla Yüksel, Mehmet Fatih Tasgetiren, Levent Kandiller, Quan-Ke Pan Metaheuristics for Energy-Efficient No-Wait Flowshops: A Trade-off Between Makespan and Total Energy Consumption. Search on Bibsonomy CEC The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Ali Al-Haboobi, Gabor Kecskemeti Improving Existing WMS for Reduced Makespan of Workflows with Lambda. Search on Bibsonomy Euro-Par Workshops The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Olivier Beaumont, Julien Langou, Willy Quach, Alena Shilova A Makespan Lower Bound for the Tiled Cholesky Factorization Based on ALAP Schedule. Search on Bibsonomy Euro-Par The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Angel A. Juan, Pedro Copado, Javier Panadero, Christoph Laroque, Rocio de la Torre A Discrete-Event Heuristic for Makespan Optimization in Multi-Server Flow-Shop Problems with Machine re-entering. Search on Bibsonomy WSC The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Alexander V. Kononov, Yulia V. Kovalenko Makespan Minimization for Parallel Jobs with Energy Constraint. Search on Bibsonomy MOTOR The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Pascal Bercher, Conny Olz POP ≡ POCL, Right? Complexity Results for Partial Order (Causal Link) Makespan Minimization. Search on Bibsonomy AAAI The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Monique Simplicio Viana, Orides Morandin Junior, Rodrigo Colnago Contreras Transgenic Genetic Algorithm to Minimize the Makespan in the Job Shop Scheduling Problem. Search on Bibsonomy ICAART (2) The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Jesper Nederlof, Céline M. F. Swennenhuis On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. Search on Bibsonomy IPEC The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
14Gustavo Castellano Minimising Makespan of Discrete Controllers: A Qualitative Approach. Search on Bibsonomy 2020   RDF
14Nadra Tabassam Minimizing the makespan of diagnostic multi-query graphs in embedded real time systems. Search on Bibsonomy 2020   RDF
14Fuqing Zhao, Shuo Qin, Guoqiang Yang, Weimin Ma, Chuck Zhang, Houbin Song A factorial based particle swarm optimization with a population adaptation mechanism for the no-wait flow shop scheduling problem with the makespan objective. Search on Bibsonomy Expert Syst. Appl. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Mourad Benttaleb, Faicel Hnaien, Farouk Yalaoui Minimising the makespan in the two-machine job shop problem under availability constraints. Search on Bibsonomy Int. J. Prod. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Chen-Yang Cheng, Kuo-Ching Ying, Hsia-Hsiang Chen, Hsiao-Shan Lu Minimising makespan in distributed mixed no-idle flowshops. Search on Bibsonomy Int. J. Prod. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Lingfa Lu, Liqi Zhang A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan. Search on Bibsonomy RAIRO Oper. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Wei Sun 0035, Yuting Wu, Qi Lou, Yang Yu 0016 A Cooperative Coevolution Algorithm for the Seru Production With Minimizing Makespan. Search on Bibsonomy IEEE Access The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Belal Ali Al-Maytami, Pingzhi Fan, Abir Hussain, Thar Baker, Panos Liatsis A Task Scheduling Algorithm With Improved Makespan Based on Prediction of Tasks Computation Time algorithm for Cloud Computing. Search on Bibsonomy IEEE Access The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Guanghui Zhang, Keyi Xing Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Mostafa Khatami, Amir Salehipour, F. J. Hwang Makespan minimization for the m-machine ordered flow shop scheduling problem. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Tsui-Ping Chung, Jatinder N. D. Gupta, Haidan Zhao, Frank Werner 0001 Minimizing the makespan on two identical parallel machines with mold constraints. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Jeroen Burgelman, Mario Vanhoucke Computing project makespan distributions: Markovian PERT networks revisited. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14M. A. Hakim Newton, Vahid Riahi, Abdul Sattar 0001 Makespan preserving flowshop reengineering via blocking constraints. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Victor Fernandez-Viagas, Paz Perez-Gonzalez, Jose M. Framiñan Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Ibrahim Kucukkoc MILP models to minimise makespan in additive manufacturing machine scheduling problems. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Victor Fernandez-Viagas, Jose M. Framiñan A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective. Search on Bibsonomy Comput. Oper. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14A. Hussain Lal, Vishnu K. R., A. Noorul Haq Minimising the makespan in open shop scheduling problems using variants of discrete firefly algorithm. Search on Bibsonomy Int. J. Adv. Oper. Manag. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Shenghui Li, Wuhui Chen, Yufen Chen, Chuan Chen 0001, Zibin Zheng Makespan-minimized computation offloading for smart toys in edge-cloud computing. Search on Bibsonomy Electron. Commer. Res. Appl. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Arent W. de Jong, Jose Ildefonso U. Rubrico, Masaru Adachi, Takayuki Nakamura, Jun Ota 0001 A generalised makespan estimation for shop scheduling problems, using visual data and a convolutional neural network. Search on Bibsonomy Int. J. Comput. Integr. Manuf. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Laleh Ghalami, Daniel Grosu Scheduling parallel identical machines to minimize makespan: A parallel approximation algorithm. Search on Bibsonomy J. Parallel Distributed Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Ali Beynaghi, Fathollah Moztarzadeh, Amin Shahmardan, Reza Alizadeh Kordabad, Jalil Salimi, Masoud Mozafari Makespan minimization for batching work and rework process on a single facility with an aging effect: a hybrid meta-heuristic algorithm for sustainable production management. Search on Bibsonomy J. Intell. Manuf. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Pingping Lu, Gongxuan Zhang, Zhaomeng Zhu, Xiumin Zhou, Jin Sun 0001, Junlong Zhou A Review of Cost and Makespan-Aware Workflow Scheduling in Clouds. Search on Bibsonomy J. Circuits Syst. Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Jing Hua 0004, Yingqiong Peng, Yilu Xu, Kun Cao, Jing Jia Makespan Minimization for Multiprocessor Real-Time Systems under Thermal and Timing Constraints. Search on Bibsonomy J. Circuits Syst. Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Kun Cao 0001, Junlong Zhou, Peijin Cong, Liying Li, Tongquan Wei, Mingsong Chen, Shiyan Hu, Xiaobo Sharon Hu Affinity-Driven Modeling and Scheduling for Makespan Optimization in Heterogeneous Multiprocessor Systems. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Felix Happach Makespan Minimization with OR-Precedence Constraints. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
14Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder Approximation results for makespan minimization with budgeted uncertainty. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
14Alireza F. Hesaraki, Nico P. Dellaert, Ton de Kok Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Dmitry I. Arkhipov, Olga Battaïa, Alexander A. Lazarev An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Yuan Gao, Jinjiang Yuan, Chi To Ng 0001, T. C. E. Cheng A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan. Search on Bibsonomy Eur. J. Oper. Res. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Xiumin Zhou, Gongxuan Zhang, Jin Sun 0001, Junlong Zhou, Tongquan Wei, Shiyan Hu Minimizing cost and makespan for workflow scheduling in cloud using fuzzy dominance sort based HEFT. Search on Bibsonomy Future Gener. Comput. Syst. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14R. Rajkumar, R. B. Jeen Robert A Hybrid Algorithm for Multi-Objective Optimization of Minimizing Makespan and Total Flow Time in Permutation Flow Shop Scheduling Problems. Search on Bibsonomy Inf. Technol. Control. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Hugo Hissashi Miyata, Marcelo Seido Nagano, Jatinder N. D. Gupta Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Search on Bibsonomy Comput. Ind. Eng. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Chen-Yang Cheng, Kuo-Ching Ying, Shu-Fen Li, Ya-Chu Hsieh Minimizing makespan in mixed no-wait flowshops with sequence-dependent setup times. Search on Bibsonomy Comput. Ind. Eng. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Shih-Wei Lin, Kuo-Ching Ying Makespan optimization in a no-wait flowline manufacturing cell with sequence-dependent family setup times. Search on Bibsonomy Comput. Ind. Eng. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Hamed Samarghandi Minimizing the makespan in a flow shop environment under minimum and maximum time-lag constraints. Search on Bibsonomy Comput. Ind. Eng. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Yumei Huo Parallel machine makespan minimization subject to machine availability and total completion time constraints. Search on Bibsonomy J. Sched. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Damla Kizilay, Mehmet Fatih Tasgetiren, Quan-Ke Pan, Liang Gao 0001 A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion. Search on Bibsonomy Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Peng Liang 0003, Wen-Si Chen, Mingqiang Luo, Wa He, Guosheng Liu Job-shop scheduling problem considering power cost and makespan under time-of-use electricity price. Search on Bibsonomy J. Comput. Methods Sci. Eng. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Junlong Zhou, Tian Wang, Peijin Cong, Pingping Lu, Tongquan Wei, Mingsong Chen Cost and makespan-aware workflow scheduling in hybrid clouds. Search on Bibsonomy J. Syst. Archit. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Hanadi Ochi, Olfa Belkahla Driss Scheduling the distributed assembly flowshop problem to minimize the makespan. Search on Bibsonomy CENTERIS/ProjMAN/HCist The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Victor Verdugo, José Verschae Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling. Search on Bibsonomy IPCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Xiaolu Zhang, Xi Liu 0002, Weidong Li 0002, Xuejie Zhang 0002 Trade-off Between Energy Consumption and Makespan in the Mapreduce Resource Allocation Problem. Search on Bibsonomy ICAIS (2) The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Jaroslaw Rudy Algorithm-Aware Makespan Minimisation for Software Testing Under Uncertainty. Search on Bibsonomy DepCoS-RELCOMEX The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Junlong Zhou, Kun Cao 0001, Jin Sun 0001, Yi Zhang 0025, Tongquan Wei A Framework to Solve the Energy, Makespan and Lifetime Problems in Reliability-Driven Task Scheduling. Search on Bibsonomy iThings/GreenCom/CPSCom/SmartData The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Ezequiel Castellano, Víctor A. Braberman, Nicolás D'Ippolito, Sebastián Uchitel, Kenji Tei Minimising Makespan of Discrete Controllers: A Qualitative Approach. Search on Bibsonomy CDC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Hui-Min Gu, Rong Hu, Bin Qian 0001, Huai-Ping Jin, Ling Wang 0001 Whale Optimization Algorithm with Local Search for Open Shop Scheduling Problem to Minimize Makespan. Search on Bibsonomy ICIC (2) The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Shweta Khare, Hongyang Sun 0001, Julien Gascon-Samson, Kaiwen Zhang 0001, Aniruddha Gokhale, Yogesh D. Barve, Anirban Bhattacharjee, Xenofon D. Koutsoukos Linearize, predict and place: minimizing the makespan for edge-based stream processing of directed acyclic graphs. Search on Bibsonomy SEC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder Approximation Results for Makespan Minimization with Budgeted Uncertainty. Search on Bibsonomy WAOA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
14Joanna Berlinska Makespan Minimization in Data Gathering Networks with Dataset Release Times. Search on Bibsonomy PPAM (2) The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
Displaying result #401 - #500 of 1520 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license