Flexible open shop scheduling problem to minimize makespan
Authors:
- Danyu BaiDBDanyu Bai
- Zhi-Hai ZhangZZZhi-Hai Zhang
- Qiang ZhangQZQiang Zhang
- 1 March 2016
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 67, 207-215
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (71201107, 71371106)
- State Key Program of National Natural Science Foundation of China (71332005)
This publication has 29 references indexed in Scilit:
- A tabu search approach for proportionate multiprocessor open shop schedulingComputational Optimization and Applications, 2013
- Open shop scheduling problem to minimize makespan with release datesApplied Mathematical Modelling, 2013
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterionComputers & Operations Research, 2012
- A novel objective function for job-shop scheduling problem with fuzzy processing time and fuzzy due date using differential evolution algorithmThe International Journal of Advanced Manufacturing Technology, 2011
- Dense open-shop schedules with release timesTheoretical Computer Science, 2008
- A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup timesEuropean Journal of Operational Research, 2007
- Worst-case analysis of heuristics for open shops with parallel machinesEuropean Journal of Operational Research, 1993
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966