Journal
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Volume 105, Issue 2, Pages 329-344Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ijpe.2004.10.020
Keywords
scheduling; sequencing; branch-and-bound; heuristics
Ask authors/readers for more resources
This paper considers the problem of scheduling on a single machine to minimize total tardiness when family setup times exist. The paper proposes optimal branch-and-bound procedures for the case where the group technology assumption is used and for the case when the group technology assumption is removed. A heuristic procedure is also proposed to solve larger problems with the group technology assumption removed. The procedures were tested on problems of various sizes and parameters. An important finding of the tests is total tardiness can be significantly reduced by removing the group technology assumption when scheduling. (c) 2005 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available