Resource title

Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity

Resource image

image for OpenScout resource :: Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity

Resource description

In many practical situations, batching of similar jobs to avoid set-ups is performed whilst constructing a schedule. On the other hand, each job may consist of many identical items. Splitting a job often results in improved customer service or in reduced throughput time. Thus, implicit in determining a schedule is a lot-sizing decision which specifies how a job is to be split. This paper proposes a general model which combines batching and lot-sizing decisions with scheduling. A review of research on this type of model is given. Some important open problems for which furher research is required are also highlighted

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://flora.insead.edu/fichiersti_wp/Inseadwp1991/91-10.pdf

Resource license

Copyright INSEAD. All rights reserved