Heuristic procedures for scheduling job families with setups and due dates

This paper examines heuristic solution procedures for scheduling jobs on a single machine to minimize the maximum lateness in the presence of setup ti mes between different job families. It reviews the state of knowledge about the solution of this problem, which is known to be difficult to solve in g eneral, and examines natural solution approaches derived from some of the u nderlying theory. The emphasis is on the design and computational evaluatio n of new heuristic procedures. (C) 1999 John Wiley & Sons, Inc.