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), pp. 228-249. (doi:10.1016/S0377-2217(99)00153-8).

Download

Full text not available from this repository.

Description/Abstract

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.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1016/S0377-2217(99)00153-8
ISSNs: 0377-2217 (print)
Keywords: scheduling, batching, families, review, complexity, algorithm, dynamic programming, approximation
Subjects:
Organisations: Operational Research
ePrint ID: 29612
Date :
Date Event
2000Published
Date Deposited: 19 Jul 2006
Last Modified: 16 Apr 2017 22:22
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/29612

Actions (login required)

View Item View Item