Asynchronous teams for joint lot-sizing and scheduling problem in flow shops |
| |
Authors: | Márcio A.F. Belo Filho Maristela O. Santos Cláudio N. Meneses |
| |
Affiliation: | 1. Instituto de Ciências Matemáticas e de Computa??o , Universidade de S?o Paulo , S?o Carlos , S?o Paulo , Brasil marciobf@icmc.usp.br;3. Instituto de Ciências Matemáticas e de Computa??o , Universidade de S?o Paulo , S?o Carlos , S?o Paulo , Brasil;4. Universidade Federal do ABC , Santo André , S?o Paulo , Brasil |
| |
Abstract: | The integrated production scheduling and lot-sizing problem in a flow shop environment consists of establishing production lot sizes and allocating machines to process them within a planning horizon in a production line with machines arranged in series. The problem considers that demands must be met without backlogging, the capacity of the machines must be respected, and machine setups are sequence-dependent and preserved between periods of the planning horizon. The objective is to determine a production schedule to minimise the setup, production and inventory costs. A mathematical model from the literature is presented, as well as procedures for obtaining feasible solutions. However, some of the procedures have difficulty in obtaining feasible solutions for large-sized problem instances. In addition, we address the problem using different versions of the Asynchronous Team (A-Team) approach. The procedures were compared with literature heuristics based on Mixed Integer Programming. The proposed A-Team procedures outperformed the literature heuristics, especially for large instances. The developed methodologies and the results obtained are presented. |
| |
Keywords: | flow shop lot sizing scheduling asynchronous team |
|
|