Single machine scheduling with family setups to minimize total earliness and tardiness |
| |
Authors: | Jeffrey E. Schaller Jatinder N.D. Gupta |
| |
Affiliation: | 1. Department of Business Administration, Eastern Connecticut State University, Willimantic, CT 06226, USA;2. College of Administrative Science, University of Alabama in Huntsville, Huntsville, AL 35899, USA |
| |
Abstract: | This paper considers the problem of scheduling a given number of jobs on a single machine to minimize total earliness and tardiness when family setup times exist. The paper proposes optimal branch-and-bound algorithms for both the group technology assumption and if the group technology assumption is removed. A heuristic algorithm is proposed to solve larger problems with the group technology assumption removed. The proposed algorithms were empirically evaluated on problems of various sizes and parameters. The paper also explores how the choice of procedure affects total earliness and tardiness if an implementation of lean production methods has resulted in a reduction in setup times. An important finding of these empirical investigations is that scheduling jobs by removing the group technology assumption can significantly reduce total earliness and tardiness. |
| |
Keywords: | Single machine scheduling Earliness and tardiness Family setups Inserted idle time Branch and bound Heuristic algorithms Empirical results |
本文献已被 ScienceDirect 等数据库收录! |