By Topic

Optimization-based job shop scheduling with transfer lots

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bin Jin ; Dept. of Electr. & Syst. Eng., Connecticut Univ., Storrs, CT, USA ; Luh, P.B. ; Thakur, L.S.

Effective scheduling of lots is critical for the production of mid to high volume products. Compared to traditional lot production, using transfer lots can significantly reduce manufacturing lead times and lower work-in-process (WIP) inventory levels. This paper presents a novel integer programming formulation with separable structure and an optimization-based solution methodology for job shop scheduling with transfer lots. Through explicit modeling of lot dynamics, transfer lots can be handled on machines with setups. The solution methodology is based on Lagrangian relaxation (LR), backward dynamic programming (BDP), and heuristics. The algorithm has been implemented using object-oriented programming language C++, and numerical testing results show that schedules with transfer lots are generated by this algorithm to achieve on-time delivery of products and low WIP inventory.

Published in:

Control Applications, 1997., Proceedings of the 1997 IEEE International Conference on

Date of Conference:

5-7 Oct. 1997