An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
Authors:
- Bassem JarbouiBJBassem Jarboui
- Mansour EddalyMEMansour Eddaly
- Patrick SiarryPSPatrick Siarry
- 1 September 2009
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 36 (9) , 2638-2646
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Flowshop scheduling research after five decadesEuropean Journal of Operational Research, 2006
- An efficient constructive heuristic for flowtime minimisation in permutation flow shopsOmega, 2003
- A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problemsInternational Journal of Production Economics, 2002
- Constructive and composite heuristic solutions to the P//∑Ci scheduling problemEuropean Journal of Operational Research, 2001
- A heuristic algorithm for mean flowtime objective in flowshop schedulingComputers & Operations Research, 1998
- Flowshop scheduling with dominant machinesComputers & Operations Research, 1995
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxationAnnals of Operations Research, 1990
- Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound ApproachA I I E Transactions, 1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965