A memetic algorithm to solve uncertain energy-efficient flow shop scheduling problems
- 10 May 2021
- journal article
- research article
- Published by Springer Science and Business Media LLC in The International Journal of Advanced Manufacturing Technology
- Vol. 115 (1-2), 515-530
- https://doi.org/10.1007/s00170-021-07228-7
Abstract
No abstract availableKeywords
This publication has 61 references indexed in Scilit:
- Flow shop rescheduling under different types of disruptionInternational Journal of Production Research, 2013
- A two-stage hybrid memetic algorithm for multiobjective job shop schedulingExpert Systems with Applications, 2011
- Production scheduling with a memetic algorithmInternational Journal of Innovative Computing and Applications, 2010
- An improved genetic algorithm for the flowshop scheduling problemInternational Journal of Production Research, 2008
- An improved NEH heuristic to minimize makespan in permutation flow shopsComputers & Operations Research, 2008
- Flow shop rescheduling problem under rush ordersJournal of Zhejiang University-SCIENCE A, 2005
- A memetic algorithm for the total tardiness single machine scheduling problemEuropean Journal of Operational Research, 2001
- Variable neighborhood searchComputers & Operations Research, 1997
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954