A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case |
| |
| Affiliation: | 1. Pablo de Olavide University, Ctra. Utrera, Km 1, 41013 Seville, Spain;2. Alma Mater, University of Bologna, DEI “Guglielmo Marconi”, Viale Risorgimento, 2, 40136 Bologna, Italy;3. University of Málaga, Campus El Ejido s/n, 29071 Málaga, Spain;1. Department of Chemical Engineering, Nagoya University, Furo-cho, Chikusa-ku, Nagoya, Aichi, 464-8603, Japan;2. College of Mechanical Engineering, Tianjin University of Science and Technology, Tianjin, 300222, China;3. Guangzhou Institute of Energy Conversion, Chinese Academy of Sciences, Guangzhou, 510640, China;1. GREThA (UMR CNRS 5113) – Université Montesquieu, Bordeaux IV, France;2. Dipartimento di Economia e Statistica “Cognetti de Martiis”, Università di Torino, Italy;3. Dipartimento di Scienze Economiche, Università di Bologna, Italy;4. CRIOS, Università “L. Bocconi”, Milano, Italy |
| |
| Abstract: | The ELDSP problem is a combined lot sizing and sequencing problem. A supplier produces and delivers components of different types to a consumer in batches. The task is to determine the cycle time, i.e., the time between deliveries, which minimizes the total cost per time unit. This includes the determination of the production sequence of the component types within each cycle.We investigate the computational behavior of two published algorithms, a heuristic and an optimal algorithm. With large number of component types, the optimal algorithm has long running times. We devise a hybrid algorithm, which is both optimal and efficient. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
