Journal
JOURNAL OF SCHEDULING
Volume 13, Issue 3, Pages 245-259Publisher
SPRINGER
DOI: 10.1007/s10951-009-0156-2
Keywords
Lot sizing; Unrelated parallel machines scheduling; Sequence dependent setup; Changeover setup
Ask authors/readers for more resources
We consider here the lot sizing and scheduling problem in single-level manufacturing systems. The shop floor is composed of unrelated parallel machines with sequence dependent setup times. We propose an integer programming model embedding precise capacity information due to scheduling constraints in a classical lot-sizing model. We also propose an iterative approach to generate a production plan taking into account scheduling constraints due to changeover setup times. The procedure executes two decision modules per iteration: a lot-sizing module and a scheduling module. The capacitated lot-sizing problem is solved to optimality considering estimated data and aggregate information, and the scheduling problem is solved by a GRASP heuristic. In the proposed scheme the information flow connecting the two levels is managed in each iteration. We report a set of computational experiments and discuss future work.
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