New Mathematical Model and Algorithm for Economic Lot Scheduling Problem in Flexible Flow Shop

This paper addresses the lot sizing and scheduling problem for a number of products in flexible flow shop with identical parallel machines. The production stages are in series, while separated by finite intermediate buffers. The objective is to minimize the sum of setup and inventory holding costs per unit of time. The available mathematical model of this problem in the literature suffers from huge complexity in terms of size and computation. In this paper, a new mixed integer linear program is developed for delay with the huge dimentions of the problem. Also, a new meta heuristic algorithm is developed for the problem. The results of the numerical experiments represent a significant advantage of the proposed model and algorithm compared with the available models and algorithms in the literature.

[1]  M. K. El-Najdawi.  A job-splitting heuristic for lot-size scheduling in multi-stage, multi-product production processes , 1994 .

[2]  Fayez F. Boctor,et al.  The impact of sequencing decisions on multi-item lot sizing and scheduling in flow shops , 1999 .

[3]  Seyyed M. T. Fatemi Ghomi,et al.  Production , Manufacturing and Logistics A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains , 2006 .

[4]  Pierre Hansen,et al.  A Tutorial on Variable Neighborhood Search , 2003 .

[5]  Dong X. Shaw,et al.  Complexity of the ELSP with general cyclic schedules , 1997 .

[6]  Behrooz Karimi,et al.  Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: The finite horizon case , 2006, Appl. Math. Comput..

[7]  Ghasem Moslehi,et al.  A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion , 2014, Comput. Oper. Res..

[8]  Edward A. Silver,et al.  Hybrid genetic algorithm for the economic lot-scheduling problem , 2002 .

[9]  J. Ouenniche,et al.  SEQUENCING, LOT SIZING AND SCHEDULING OF SEVERAL PRODUCTS IN JOB SHOPS : THE COMMON CYCLE APPROACH , 1998 .

[10]  Paul R. Kleindorfer,et al.  Common cycle lot-size scheduling for multi-product, multi-stage production , 1993 .

[11]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[12]  Candace Arai Yano,et al.  Cyclic scheduling to minimize inventory in a batch flow line , 1994 .

[13]  Wen-Tsao Pan,et al.  A new Fruit Fly Optimization Algorithm: Taking the financial distress model as an example , 2012, Knowl. Based Syst..

[14]  Sara Hatami,et al.  The Distributed Assembly Permutation Flowshop Scheduling Problem , 2013 .

[15]  John M. Wilson,et al.  The capacitated lot sizing problem: a review of models and algorithms , 2003 .

[16]  Deming Lei,et al.  Variable neighborhood search for two-agent flow shop scheduling problem , 2015, Comput. Ind. Eng..

[17]  Alcides R. Santander-Mercado,et al.  The economic lot scheduling problem: a survey , 2016 .

[18]  Anders Segerstedt,et al.  Economic Order Quantities in production: From Harris to Economic Lot Scheduling Problems , 2014 .

[19]  Samuel G. Davis.  Scheduling Economic Lot Size Production Runs , 1990 .

[20]  Jack D. Rogers.  A Computational Approach to the Economic Lot Scheduling Problem , 1958 .