Flow shop scheduling with jobs arriving at different times
- 22 October 2018
- journal article
- research article
- Published by Elsevier BV in International Journal of Production Economics
- Vol. 206, 250-260
- https://doi.org/10.1016/j.ijpe.2018.10.010
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (91746110, 71372019, 71521002, 71642004)
- National Basic Research Program of China
- Special Items Fund of Beijing Municipal Commission of Education
This publication has 57 references indexed in Scilit:
- A two-stage robust approach for the reliable logistics network design problemTransportation Research Part B: Methodological, 2018
- A three-layer chromosome genetic algorithm for multi-cell scheduling with flexible routes and machine sharingInternational Journal of Production Economics, 2018
- A new set of high-performing heuristics to minimise flowtime in permutation flowshopsComputers & Operations Research, 2015
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problemComputers & Operations Research, 2014
- Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithmInternational Journal of Production Economics, 2011
- An improved NEH-based heuristic for the permutation flowshop problemComputers & Operations Research, 2008
- Evaluating the performance for makespan minimisation in no-wait flowshop sequencingJournal of the American Academy of Dermatology, 2008
- An efficient constructive heuristic for flowtime minimisation in permutation flow shopsOmega, 2003
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problemInternational Journal of Production Research, 2003
- A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategiesComputers & Industrial Engineering, 1999