An effective method to reduce inventory in job shops

Inventory plays a major role in deciding the overall manufacturing costs, and a good scheduling system should balance the on-time delivery of products versus low work-in-progress (WIP) inventory. In this paper, the "constant work-in-process" (CONWIP) concept is applied to job shop scheduling to effectively control WIP inventory. A new mathematical formulation of CONWIP-based job shop scheduling with a separable structure is presented. By using a synergistic combination of Lagrangian relaxation, dynamic programming, and heuristic methods, good schedules are obtained in a reasonable amount of computation time. Results show that the new method can directly control the maximum WIP levels while maintaining good on-time delivery performance.

[1]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Network with Controllable Inputs , 2011, Oper. Res..

[2]  Pang C. Chen.  Adaptive path planning: algorithm and analysis , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[3]  Izak Duenyas.  A Simple Release Policy for Networks of Queues with Controllable Inputs , 1994, Oper. Res..

[4]  P. Luh,et al.  Job shop scheduling with group-dependent setups, finite buffers, and long time horizon , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[5]  Peter B. Luh,et al.  Scheduling products with bills of materials using an improved Lagrangian relaxation technique , 1994, IEEE Trans. Robotics Autom..

[6]  Michael Masin,et al.  Mathematical programming formulation of CONWIP based production lines; and relationships to MRP , 1997 .

[7]  X. Zhao,et al.  Surrogate Gradient Algorithm for Lagrangian Relaxation , 1999 .

[8]  Krishna R. Pattipati,et al.  A practical approach to job-shop scheduling problems , 1993, IEEE Trans. Robotics Autom..

[9]  David L. Woodruff,et al.  CONWIP: a pull alternative to kanban , 1990 .

[10]  Chengbin Chu,et al.  A more efficient Lagrangian relaxation approach to job-shop scheduling problems , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[11]  Tetsuo Hasegawa,et al.  FINITE BUFFERS, AND LONG TIME HORIZON , 1995 .

[12]  Peter B. Luh,et al.  An optimization-based algorithm for job shop scheduling , 1997 .