A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
Authors:
- Chia-Shin ChungCCChia-Shin Chung
- James FlynnJFJames Flynn
- Ömer KircaÖKÖmer Kirca
- 1 October 2006
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 174 (1) , 1-10
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problemsInternational Journal of Production Economics, 2002
- A quick optimal algorithm for sequencing on one machine to minimize total tardinessInternational Journal of Production Economics, 1999
- Minimizing total tardiness in permutation flowshopsEuropean Journal of Operational Research, 1995
- The Total Tardiness Problem: Review and ExtensionsOperations Research, 1994
- An efficient algorithm for the single machine tardiness problemInternational Journal of Production Economics, 1994
- A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshopsComputers & Operations Research, 1993
- Heuristics for Flowshop Scheduling Problems Minimizing Mean TardinessJournal of the Operational Research Society, 1993
- A branch-and-bound algorithm to minimize total tardiness with different release datesNaval Research Logistics (NRL), 1992
- A Heuristic Algorithm for Sequencing on One Machine to Minimize Total TardinessJournal of the Operational Research Society, 1992
- A dual algorithm for the one-machine scheduling problemMathematical Programming, 1976