Scheduling with batching: a review
Potts, Chris N. and Kovalyov, Mikhail Y. (2000) Scheduling with batching: a review. European Journal of Operational Research, 120, (2), 228-249. (doi:10.1016/S0377-2217(99)00153-8).
Full text not available from this repository.
There is an extensive literature on models that integrate scheduling with batching decisions. Jobs may be batched if they share the same setup on a machine. Another reason for batching occurs when a machine can process several jobs simultaneously. This paper reviews the literature on scheduling with batching, giving details of the basic algorithms, and referencing other significant results. Special attention is given to the design of efficient dynamic programming algorithms for solving these types of problems.
|Keywords:||scheduling, batching, families, review, complexity, algorithm, dynamic programming, approximation|
|Subjects:||H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
Q Science > QA Mathematics
|Divisions:||University Structure - Pre August 2011 > School of Mathematics > Operational Research
|Date Deposited:||19 Jul 2006|
|Last Modified:||02 Mar 2012 12:05|
|Contact Email Address:||C.N.Potts@maths.soton.ac.uk|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)