A two-machine flowshop scheduling problem with precedence constraint on two jobs
Authors:
- 29 October 2015
- journal article
- Published by Springer Nature in Soft Computing
- Vol. 21 (8) , 2091-2103
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffersComputers & Operations Research, 2009
- A bi-criteria two-machine flowshop scheduling problem with a learning effectJournal of the Operational Research Society, 2006
- A genetic algorithm for flow shop scheduling problemsJournal of the Operational Research Society, 2004
- Genetic algorithm for minimizing tardiness in flow-shop schedulingProduction Planning & Control, 1999
- A multi-objective genetic local search algorithm and its application to flowshop schedulingIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 1998
- Two-machine flowshop scheduling to minimize total tardinessInternational Journal of Systems Science, 1997
- A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs-a case studyProduction Planning & Control, 1997
- The two-machine total completion time flow shop problemEuropean Journal of Operational Research, 1996
- Minimizing total tardiness in permutation flowshopsEuropean Journal of Operational Research, 1995
- Four simple heuristics for scheduling a flow-shopInternational Journal of Production Research, 1978