New heuristics to minimize total completion time in m-machine flowshops
- 31 May 2002
- journal article
- Published by Elsevier BV in International Journal of Production Economics
- Vol. 77 (1), 71-83
- https://doi.org/10.1016/s0925-5273(01)00228-6
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup timesComputers & Operations Research, 2000
- Stochastically minimizing total flowtime in flowshops with no waiting spaceEuropean Journal of Operational Research, 1999
- The two-machine total completion time flow shop problemEuropean Journal of Operational Research, 1996
- Two-machine ordered flowshop scheduling under random breakdownsMathematical and Computer Modelling, 1994
- The permutation flow shop problem with sum-of-completion times performance criterionNaval Research Logistics (NRL), 1993
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxationAnnals of Operations Research, 1990
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shopEuropean Journal of Operational Research, 1990
- Flowshop and Jobshop Schedules: Complexity and ApproximationOperations Research, 1978
- 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
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954