Scheduling Groups of Jobs on a Single Machine

Scott Webster and Kenneth R. Baker
Additional contact information
Scott Webster: University of Wisconsin, Madison, Wisconsin
Kenneth R. Baker: Dartmouth College, Hanover, New Hampshire

Operations Research, 1995, vol. 43, issue 4, 692-703

Abstract: Economies of scale are fundamental to manufacturing operations. With respect to scheduling, this phenomenon manifests itself in efficiencies gained from grouping similar jobs together. This paper reviews the rapidly growing literature on single-machine scheduling models that incorporate benefits from job grouping. We focus on three basic models known as family scheduling with item availability , family scheduling with batch availability , and batch processing . We present known results and introduce new results, and we pay special attention to key theoretical properties and the use of these properties in optimization procedures.

Keywords: production/scheduling; deterministic sequencing and grouping (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations: View citations in EconPapers (89)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.43.4.692 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:43:y:1995:i:4:p:692-703

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().