Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 120, Issue 2, Pages 228-249Publisher
ELSEVIER
DOI: 10.1016/S0377-2217(99)00153-8
Keywords
scheduling; batching; families; review; complexity; algorithm; dynamic programming; approximation
Ask authors/readers for more resources
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 call 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. (C) 2000 Elsevier Science B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available