A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem
Authors:
Open Access
- 31 January 2008
- journal article
- Published by Elsevier in Expert Systems with Applications
- Vol. 34 (1) , 570-577
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Two‐phase sub population genetic algorithm for parallel machine-scheduling problemExpert Systems with Applications, 2005
- Managing simple re-entrant flow lines: theoretical foundation and experimental resultsIIE Transactions, 2001
- Decomposition methods for reentrant flow shops with sequence-dependent setup timesJournal of Scheduling, 2000
- A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategiesComputers & Industrial Engineering, 1999
- Production sequencing problem with re-entrant work flows and sequence dependent setup timesInternational Journal of Production Research, 1998
- A tutorial survey of job-shop scheduling problems using genetic algorithms—I. representationComputers & Industrial Engineering, 1996
- OR-Library: Distributing Test Problems by Electronic MailJournal of the Operational Research Society, 1990
- Scheduling of re‐entrant flow shopsJournal of Operations Management, 1983
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954