Heuristic Procedures for Scheduling Job Families with Setups and Due Dates

  title={Heuristic Procedures for Scheduling Job Families with Setups and Due Dates},
  author={Kenneth R. Baker},
This paper examines heuristic solution procedures for scheduling jobs on a single machine to minimize the maximum lateness in the presence of setup times 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 general, and examines natural solution approaches derived from some of the underlying theory. The emphasis is on the design and computational evaluation of new heuristic procedures. c © 1999 John… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS
17 Citations
12 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 17 extracted citations


Publications referenced by this paper.
Showing 1-10 of 12 references

Generating experimental data for scheduling problems, manuscript

  • N. G. Hall, M. E. Posner
  • Ohio State University,
  • 1996
Highly Influential
6 Excerpts

A new heuristic for a single machine scheduling problem with set-up times

  • D. Williams, A. Wirth
  • J Oper Res Soc
  • 1996
2 Excerpts

Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity

  • C. N. Potts, L. N. Van Wassenhove
  • J Oper Res Soc
  • 1992
3 Excerpts

Minimizing flow time on a single machine with job classes and setup times

  • A. J. Mason, E. J. Anderson
  • Nav Res Logistics
  • 1991
2 Excerpts

Similar Papers

Loading similar papers…