Search results for "Makespan"

Hits ?▲	Authors	Title	Venue	Year	Link
14	Chen Chen, Xiaodi Ke, Timothy Zeyl, Kaixiang Du, Sam Sanjabi, Shane Bergsma, Reza Pournaghi, Chong Chen	Minimum Makespan Workflow Scheduling for Malleable Jobs with Precedence Constraints and Lifetime Resource Demands.	ICDCS	2019	DBLP DOI BibTeX RDF
14	Marek Vlk, Antonín Novák, Zdenek Hanzálek	Makespan Minimization with Sequence-dependent Non-overlapping Setups.	ICORES	2019	DBLP DOI BibTeX RDF
14	Meenakshi Sharma, Manisha Sharma, Sameer Sharma, Amit Kumar	Flow Shop Scheduling Problem of Minimizing Makespan with Bounded Processing Parameters.	SocProS (1)	2019	DBLP DOI BibTeX RDF
14	Danlami Gabi, Abdul Samad Ismail, Nasiru Muhammed Dankolo	Minimized Makespan Based Improved Cat Swarm Optimization for Efficient Task Scheduling in Cloud Datacenter.	HPCCT/BDAI	2019	DBLP DOI BibTeX RDF
14	Jiaxin Fan, Damla Kizilay, Hande Öztop, Mehmet Fatih Tasgetiren, Liang Gao 0001	A Variable Block Insertion Heuristic for Single Machine with Release Dates and Sequence Dependent Setup Times for Makespan Minimization.	SSCI	2019	DBLP DOI BibTeX RDF
14	Liangshan Shen, Mehmet Fatih Tasgetiren, Hande Öztop, Levent Kandiller, Liang Gao 0001	A General Variable Neighborhood Search for the NoIdle Flowshop Scheduling Problem with Makespan Criterion.	SSCI	2019	DBLP DOI BibTeX RDF
14	Victor Fernandez-Viagas, Jose M. Molina-Pariente, Jose M. Framiñan	New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics.	Expert Syst. Appl.	2018	DBLP DOI BibTeX RDF
14	Kuo-Ching Ying, Shih-Wei Lin	Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks.	Expert Syst. Appl.	2018	DBLP DOI BibTeX RDF
14	Shesh Narayan Sahu, Yuvraj Gajpal, Swapan Debbarma	Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives.	Ann. Oper. Res.	2018	DBLP DOI BibTeX RDF
14	Guanghui Zhang, Keyi Xing, Feng Cao	Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespan.	Int. J. Prod. Res.	2018	DBLP DOI BibTeX RDF
14	Golshan Madraki, Robert P. Judd	Efficient algorithm to find makespan in manufacturing systems under multiple scheduling perturbations.	Int. J. Prod. Res.	2018	DBLP DOI BibTeX RDF
14	Anjulika Gupta, Prabha Sharma, Hemant Salwan	A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights.	EURO J. Comput. Optim.	2018	DBLP DOI BibTeX RDF
14	Shih-Wei Lin, Chung-Cheng Jason Lu, Kuo-Ching Ying	Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop.	IEEE Access	2018	DBLP DOI BibTeX RDF
14	Mehdi Mrad, Nizar Souayah	An Arc-Flow Model for the Makespan Minimization Problem on Identical Parallel Machines.	IEEE Access	2018	DBLP DOI BibTeX RDF
14	Shih-Wei Lin, Chien-Yi Huang, Kuo-Ching Ying, Dar-Lun Chen	Decreasing the System Testing Makespan in a Computer Manufacturing Company.	IEEE Access	2018	DBLP DOI BibTeX RDF
14	Alexander J. Benavides, Marcus Ritt	Fast heuristics for minimizing the makespan in non-permutation flow shops.	Comput. Oper. Res.	2018	DBLP DOI BibTeX RDF
14	Vitor Nesello, Maxence Delorme, Manuel Iori, Anand Subramanian 0001	Mathematical models and decomposition algorithms for makespan minimization in plastic rolls production.	J. Oper. Res. Soc.	2018	DBLP DOI BibTeX RDF
14	Reza Ramezani, Yasser Sedaghat, Mahmoud Naghibzadeh, Juan Antonio Clemente	A decomposition-based reliability and makespan optimization technique for hardware task graphs.	Reliab. Eng. Syst. Saf.	2018	DBLP DOI BibTeX RDF
14	Zhichao Geng, Jinjiang Yuan, Junling Yuan	Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost.	Appl. Math. Comput.	2018	DBLP DOI BibTeX RDF
14	Wenjie Li, Shisheng Li, Qi Feng	Online batch scheduling with kind release times and incompatible families to minimize makespan.	Optim. Lett.	2018	DBLP DOI BibTeX RDF
14	Ellur Anand, R. Panneerselvam	Development of efficient genetic algorithm for open shop scheduling problem to minimise makespan.	Int. J. Adv. Oper. Manag.	2018	DBLP DOI BibTeX RDF
14	Klaus Jansen, Kati Land, Marten Maack	Estimating the Makespan of the Two-Valued Restricted Assignment Problem.	Algorithmica	2018	DBLP DOI BibTeX RDF
14	Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin	An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops.	Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
14	Thi-Kien Dao, Tien-Szu Pan, Trong-The Nguyen, Jeng-Shyang Pan 0001	Parallel bat algorithm for optimizing makespan in job shop scheduling problems.	J. Intell. Manuf.	2018	DBLP DOI BibTeX RDF
14	Henri Casanova, Julien Herrmann, Yves Robert	Computing the expected makespan of task graphs in the presence of silent errors.	Parallel Comput.	2018	DBLP DOI BibTeX RDF
14	Vineet Jain, Tilak Raj	An adaptive neuro-fuzzy inference system for makespan estimation of flexible manufacturing system assembly shop: a case study.	Int. J. Syst. Assur. Eng. Manag.	2018	DBLP DOI BibTeX RDF
14	A. Sathya Sofia, P. Ganeshkumar	Multi-objective Task Scheduling to Minimize Energy Consumption and Makespan of Cloud Computing Using NSGA-II.	J. Netw. Syst. Manag.	2018	DBLP DOI BibTeX RDF
14	Amariah Becker, Alice Paul	A PTAS for Minimum Makespan Vehicle Routing in Trees.	CoRR	2018	DBLP BibTeX RDF
14	Victor Verdugo, José Verschae	Breaking symmetries to rescue Sum of Squares: The case of makespan scheduling.	CoRR	2018	DBLP BibTeX RDF
14	Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman	An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines.	CoRR	2018	DBLP BibTeX RDF
14	Zhiyi Huang 0002, Ning Kang 0001, Zhihao Gavin Tang, Xiaowei Wu 0001, Yuhao Zhang 0001	Online Makespan Minimization: The Power of Restart.	CoRR	2018	DBLP BibTeX RDF
14	Mahshid Helali Moghadam, Seyed Morteza Babamir	Makespan reduction for dynamic workloads in cluster-based data grids using reinforcement-learning based scheduling.	J. Comput. Sci.	2018	DBLP DOI BibTeX RDF
14	Ali Allahverdi, Harun Aydilek, Asiye Aydilek	No-wait flowshop scheduling problem with two criteria; total tardiness and makespan.	Eur. J. Oper. Res.	2018	DBLP DOI BibTeX RDF
14	Mehdi Gaham, Brahim Bouzouia, Nouara Achour	An effective operations permutation-based discrete harmony search approach for the flexible job shop scheduling problem with makespan criterion.	Appl. Intell.	2018	DBLP DOI BibTeX RDF
14	Guanghui Zhang, Keyi Xing, Feng Cao	Discrete differential evolution algorithm for distributed blocking flowshop scheduling with makespan criterion.	Eng. Appl. Artif. Intell.	2018	DBLP DOI BibTeX RDF
14	Bailin Wang, Kai Huang 0003, Tieke Li	Permutation flowshop scheduling with time lag constraints and makespan criterion.	Comput. Ind. Eng.	2018	DBLP DOI BibTeX RDF
14	Kuo-Ching Ying, Shih-Wei Lin	Minimizing makespan for no-wait flowshop scheduling problems with setup times.	Comput. Ind. Eng.	2018	DBLP DOI BibTeX RDF
14	Mourad Benttaleb, Faicel Hnaien, Farouk Yalaoui	Two-machine job shop problem under availability constraints on one machine: Makespan minimization.	Comput. Ind. Eng.	2018	DBLP DOI BibTeX RDF
14	Liji Shen, Jatinder N. D. Gupta	Family scheduling with batch availability in flow shops to minimize makespan.	J. Sched.	2018	DBLP DOI BibTeX RDF
14	Leah Epstein	A survey on makespan minimization in semi-online environments.	J. Sched.	2018	DBLP DOI BibTeX RDF
14	Manzhan Gu, Jinwei Gu, Xiwen Lu	An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines.	J. Sched.	2018	DBLP DOI BibTeX RDF
14	M. K. Marichelvam, M. Geetha 0001	A hybrid crow search algorithm to minimise the weighted sum of makespan and total flow time in a flow shop environment.	Int. J. Comput. Aided Eng. Technol.	2018	DBLP DOI BibTeX RDF
14	Margaret Pearce, Bilge Mutlu, Julie A. Shah, Robert G. Radwin	Optimizing Makespan and Ergonomics in Integrating Collaborative Robots Into Manufacturing Processes.	IEEE Trans Autom. Sci. Eng.	2018	DBLP DOI BibTeX RDF
14	Ji-Bo Wang, Lu Liu, Jian-Jun Wang 0001, Lin Li	Makespan minimization scheduling with ready times, group technology and shortening job processing times.	Comput. J.	2018	DBLP DOI BibTeX RDF
14	Jinwei Gu, Manzhan Gu, Xiwen Lu, Ying Zhang	Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan.	J. Comb. Optim.	2018	DBLP DOI BibTeX RDF
14	Xing Chai, Wenhua Li	Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan.	J. Comb. Optim.	2018	DBLP DOI BibTeX RDF
14	Fatima Zohra Boumediene, Yamina Houbad, Ahmed Hassam, Latéfa Ghomri	A New Hybrid Genetic Algorithm to Deal with the Flow Shop Scheduling Problem for Makespan Minimization.	CIIA	2018	DBLP DOI BibTeX RDF
14	Majun He, Wenxia Guo, Houwen Huang, Bo He, Jing Wang, Wenhong Tian	On Minimizing the Makespan of a Set of Offline MapReduce Jobs.	SERVICES	2018	DBLP DOI BibTeX RDF
14	Artur Brum, Marcus Ritt	Automatic Design of Heuristics for Minimizing the Makespan in Permutation Flow Shops.	CEC	2018	DBLP DOI BibTeX RDF
14	Matthias Englert, David Mezlaf, Matthias Westermann	Online Makespan Scheduling with Job Migration on Uniform Machines.	ESA	2018	DBLP DOI BibTeX RDF
14	Yuanzhe Li, Laleh Ghalami, Loren Schwiebert, Daniel Grosu	A GPU Parallel Approximation Algorithm for Scheduling Parallel Identical Machines to Minimize Makespan.	IPDPS Workshops	2018	DBLP DOI BibTeX RDF
14	Gabriela Amaral, Lino A. Costa, Ana Maria A. C. Rocha, Leonilde Rocha Varela, Ana Madureira	Application of the Simulated Annealing Algorithm to Minimize the makespan on the Unrelated Parallel Machine Scheduling Problem with Setup Times.	HIS	2018	DBLP DOI BibTeX RDF
14	Daniel R. Page, Roberto Solis-Oba, Marten Maack	Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments.	COCOA	2018	DBLP DOI BibTeX RDF
14	Zhiyi Huang 0002, Ning Kang 0001, Zhihao Gavin Tang, Xiaowei Wu 0001, Yuhao Zhang 0001	Online Makespan Minimization: The Power of Restart.	APPROX-RANDOM	2018	DBLP DOI BibTeX RDF
14	Daniel R. Page, Roberto Solis-Oba	Makespan Minimization on Unrelated Parallel Machines with a Few Bags.	AAIM	2018	DBLP DOI BibTeX RDF
14	Carlos Guerrero, Isaac Lera, Carlos Juiz	On the Influence of Fog Colonies Partitioning in Fog Application Makespan.	FiCloud	2018	DBLP DOI BibTeX RDF
14	Nikolai Krivulin	Tropical optimization problems with application to project scheduling with minimum makespan.	Ann. Oper. Res.	2017	DBLP DOI BibTeX RDF
14	Onur Ozturk, Mehmet A. Begen, Gregory S. Zaric	A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan.	Int. J. Prod. Res.	2017	DBLP DOI BibTeX RDF
14	Yang Yu 0016, Wei Sun 0035, Jiafu Tang, Ikou Kaku, Junwei Wang 0001	Line-seru conversion towards reducing worker(s) without increasing makespan: models, exact and meta-heuristic solutions.	Int. J. Prod. Res.	2017	DBLP DOI BibTeX RDF
14	Xiaolin Li, Yupeng Li, Yu Wang	Minimising makespan on a batch processing machine using heuristics improved by an enumeration scheme.	Int. J. Prod. Res.	2017	DBLP DOI BibTeX RDF
14	Simon Thevenin, Nicolas Zufferey, Jean-Yves Potvin	Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility.	Int. J. Prod. Res.	2017	DBLP DOI BibTeX RDF
14	Alex J. Ruiz-Torres, Giuseppe Paletta, Rym M'Hallah	Makespan minimisation with sequence-dependent machine deterioration and maintenance events.	Int. J. Prod. Res.	2017	DBLP DOI BibTeX RDF
14	Reza Ramezani, Yasser Sedaghat, Mahmoud Naghibzadeh, Juan Antonio Clemente	Reliability and Makespan Optimization of Hardware Task Graphs in Partially Reconfigurable Platforms.	IEEE Trans. Aerosp. Electron. Syst.	2017	DBLP DOI BibTeX RDF
14	Shih-Wei Lin, Kuo-Ching Ying	Uniform Parallel-Machine Scheduling for Minimizing Total Resource Consumption With a Bounded Makespan.	IEEE Access	2017	DBLP DOI BibTeX RDF
14	Kuo-Ching Ying, Shih-Wei Lin	Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms.	IEEE Access	2017	DBLP DOI BibTeX RDF
14	Mehmet Fatih Tasgetiren, Damla Kizilay, Quan-Ke Pan, Ponnuthurai N. Suganthan	Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion.	Comput. Oper. Res.	2017	DBLP DOI BibTeX RDF
14	Wei-Wei Cui, Zhiqiang Lu	Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates.	Comput. Oper. Res.	2017	DBLP DOI BibTeX RDF
14	Jérémie Dubois-Lacoste, Federico Pagnozzi, Thomas Stützle	An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem.	Comput. Oper. Res.	2017	DBLP DOI BibTeX RDF
14	Haiou Jiang, Haihong E, Meina Song	Dynamic Scheduling of Workflow for Makespan and Robustness Improvement in the IaaS Cloud.	IEICE Trans. Inf. Syst.	2017	DBLP DOI BibTeX RDF
14	Alexander A. Lazarev, Dmitry I. Arkhipov, Frank Werner 0001	Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan.	Optim. Lett.	2017	DBLP DOI BibTeX RDF
14	Sel Özcan, Deniz Türsel Eliiyi, Levent Kandiller	An alternative MILP model for makespan minimization on assembly lines.	Optim. Lett.	2017	DBLP DOI BibTeX RDF
14	Taibo Luo, Yuqing Zhu 0002, Weili Wu 0001, Yin-Feng Xu, Ding-Zhu Du	Online makespan minimization in MapReduce-like systems with complex reduce tasks.	Optim. Lett.	2017	DBLP DOI BibTeX RDF
14	Pavel Surynek	Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems.	Ann. Math. Artif. Intell.	2017	DBLP DOI BibTeX RDF
14	Zhao-Hong Jia, Ming-li Pei, Joseph Y.-T. Leung	Multi-objective ACO algorithms to minimise the makespan and the total rejection cost on BPMs with arbitrary job weights.	Int. J. Syst. Sci.	2017	DBLP DOI BibTeX RDF
14	Susanne Albers, Matthias Hellwig	Online Makespan Minimization with Parallel Schedules.	Algorithmica	2017	DBLP DOI BibTeX RDF
14	Susanne Albers, Matthias Hellwig	On the Value of Job Migration in Online Makespan Minimization.	Algorithmica	2017	DBLP DOI BibTeX RDF
14	Quang-Vinh Dang 0002, Lam Nguyen	Makespan minimisation for pre-emptive scheduling of mobile robots in FMS environment.	Int. J. Metaheuristics	2017	DBLP DOI BibTeX RDF
14	Antonio Costa 0001, Fulvio Antonio Cappadonna, Sergio Fichera	A hybrid genetic algorithm for minimizing makespan in a flow-shop sequence-dependent group scheduling problem.	J. Intell. Manuf.	2017	DBLP DOI BibTeX RDF
14	Mohammad Komaki, Behnam Malakooti	General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem.	Prod. Eng.	2017	DBLP DOI BibTeX RDF
14	Michal Feldman, Amos Fiat, Alan Roytman	Makespan Minimization via Posted Prices.	CoRR	2017	DBLP BibTeX RDF
14	Maurizio Naldi, Marta Flamini	Project Makespan Estimation: Computational Load of Interval and Point Estimates.	CoRR	2017	DBLP BibTeX RDF
14	Shengchao Zhou, Huaping Chen 0001, Xueping Li	Distance matrix based heuristics to minimize makespan of parallel batch processing machines with arbitrary job sizes and release times.	Appl. Soft Comput.	2017	DBLP DOI BibTeX RDF
14	M. K. Marichelvam, Ömür Tosun, M. Geetha 0001	Hybrid monkey search algorithm for flow shop scheduling problem under makespan and total flow time.	Appl. Soft Comput.	2017	DBLP DOI BibTeX RDF
14	Zhao-Hong Jia, Yu-lan Zhang, Joseph Y.-T. Leung, Kai Li 0019	Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines.	Appl. Soft Comput.	2017	DBLP DOI BibTeX RDF
14	Weishi Shao, Dechang Pi, Zhongshi Shao	Memetic algorithm with node and edge histogram for no-idle flow shop scheduling problem to minimize the makespan criterion.	Appl. Soft Comput.	2017	DBLP DOI BibTeX RDF
14	Victor Fernandez-Viagas, Rubén Ruiz, Jose M. Framiñan	A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation.	Eur. J. Oper. Res.	2017	DBLP DOI BibTeX RDF
14	Shuguang Li	Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan.	Eur. J. Oper. Res.	2017	DBLP DOI BibTeX RDF
14	Sardar Khaliq uz Zaman, Atta ur Rehman Khan, Saif Ur Rehman Malik, Abdul Nasir Khan, Tahir Maqsood, Sajjad Ahmad Madani	Formal verification and performance evaluation of task scheduling heuristics for makespan optimization and workflow distribution in large-scale computing systems.	Comput. Syst. Sci. Eng.	2017	DBLP BibTeX RDF
14	Zhao-Hong Jia, Xiaohao Li, Joseph Y.-T. Leung	Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities.	Future Gener. Comput. Syst.	2017	DBLP DOI BibTeX RDF
14	Yiwei Jiang, Yuqing Zhu 0002, Weili Wu 0001, Deying Li 0001	Makespan minimization for MapReduce systems with different servers.	Future Gener. Comput. Syst.	2017	DBLP DOI BibTeX RDF
14	Weishi Shao, Dechang Pi, Zhongshi Shao	Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms.	Knowl. Based Syst.	2017	DBLP DOI BibTeX RDF
14	Junlong Zhou, Kun Cao 0001, Peijin Cong, Tongquan Wei, Mingsong Chen, Gongxuan Zhang, Jianming Yan, Yue Ma 0001	Reliability and temperature constrained task scheduling for makespan minimization on heterogeneous multi-core platforms.	J. Syst. Softw.	2017	DBLP DOI BibTeX RDF
14	Hafewa Bargaoui, Olfa Belkahla Driss, Khaled Ghédira	A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion.	Comput. Ind. Eng.	2017	DBLP DOI BibTeX RDF
14	Wen-Chiung Lee, Jen-Ya Wang	A three-agent scheduling problem for minimizing the makespan on a single machine.	Comput. Ind. Eng.	2017	DBLP DOI BibTeX RDF
14	M. B. S. Sreekara Reddy, C. h. Ratnam, Rajeev Agrawal, Maria Leonilde R. Varela, Ila Sharma, Vijaya Kumar Manupati	Investigation of reconfiguration effect on makespan with social network method for flexible job shop scheduling problem.	Comput. Ind. Eng.	2017	DBLP DOI BibTeX RDF
14	Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen	Minimizing worst-case and average-case makespan over scenarios.	J. Sched.	2017	DBLP DOI BibTeX RDF
14	S. Kavitha, P. Venkumar	Ant-based job shop scheduling with genetic algorithm for makespan minimisation on identical machines.	Int. J. Comput. Aided Eng. Technol.	2017	DBLP DOI BibTeX RDF
14	Said Toumi, Bassem Jarboui, Mansour Eddaly, Abdelwaheb Rebaï	Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion.	Int. J. Math. Oper. Res.	2017	DBLP DOI BibTeX RDF
14	Igor Averbakh	Minimizing the makespan in multiserver network restoration problems.	Networks	2017	DBLP DOI BibTeX RDF
14	Corinna Heßler, Kaouthar Deghdak	Discrete parallel machine makespan ScheLoc problem.	J. Comb. Optim.	2017	DBLP DOI BibTeX RDF