Scheduling with batching: A review

By Chris N. Potts, Mikhail Y. Kovalyov. European Journal of Operational Research, 2000

987 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/4754c3f548f5aee7ceac53f8351fa372b0cf2467

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Industrial and Manufacturing Engineering

Citations in the corpus

A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations (2011, methodology): “In this case, the processing time of the batch is given by the maximum processing time of jobs contained in the batch (cf. Potts and Kovalyov 2000; Mathirajan and Sivakumar 2006 for recent surveys related to batching in general and to batching for semiconductor manufacturing, respectively).”
A survey of scheduling problems with setup times or costs (2008, methodology): “…description Additional characteristics Reference Job availability 1=ST si;b = P ðw i ÞC j Potts and Kovalyov (2000) Pm=ST si;b = P C j m is constant Potts and Kovalyov (2000) P/ST si,b ,p j = p,C j 6 d j /À Equal setup times s, s is not a multiple of p Brucker et al. (1998) Q m /ST si,b ,p j =…”
A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor (2006, background): “Potts and Van Wassenhove [5], Albers and Brucker [6], Webster and Baker [7], Brucker et al. [8], and Potts and Kovalyov [ 9 ] provide a good analysis of both types of scheduling with batching.”
The capacitated lot sizing problem: a review of models and algorithms (2003, background): “Further connections between scheduling and batching are reviewed in [14].”
Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration (2009, methodology): “There are reviews of models which combine scheduling with batching by Webster and Baker [1] and Potts and Kovalyov [2].”
Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost (2005, background): “Cheng, Gordon, and Kovalyov [4] consider a combined objective function for the single machine problem that takes into account the delivery costs and the sum of earliness of the orders.”
Supply chain scheduling: Batching and delivery (2003, background): “More extensive surveys can be found in Potts and Van Wassenhove (1992), Webster and Baker (1995) and Potts and Kovalyov (2000). There are two alternative assumptions that may apply for this class of problems. The first is batch availability, under which a job only becomes available for later process”