Please use this identifier to cite or link to this item: https://doi.org/10.1007/s00170-008-1808-7
Title: Genetic algorithms for the multiple-machine economic lot scheduling problem
Authors: Sun, H.
Huang, H.-C. 
Jaruphongsa, W. 
Keywords: Economic lot scheduling
Genetic algorithm
Power-of-two
Issue Date: Aug-2009
Source: Sun, H., Huang, H.-C., Jaruphongsa, W. (2009-08). Genetic algorithms for the multiple-machine economic lot scheduling problem. International Journal of Advanced Manufacturing Technology 43 (11-12) : 1251-1260. ScholarBank@NUS Repository. https://doi.org/10.1007/s00170-008-1808-7
Abstract: This paper focuses on an extension of the Economic Lot Scheduling Problem, which schedules productions of products on multiple identical machines. The objective is to minimize the total average production and inventory costs per unit time for all products. We develop a genetic algorithm under the Common Cycle policy and compare it with an existing heuristic under the same policy. Computational results show that our genetic algorithm outperforms the existing heuristic and its running time does not increase much even for high utilization problems, while the latter requires substantial time to solve most of the high utilization problems. In addition, a genetic algorithm under the Extended Basic Period and Power-of-Two policy is proposed. This new heuristic performs much better, especially when the number of machines is small and the machine utilization is not very high. © 2008 Springer-Verlag London Limited.
Source Title: International Journal of Advanced Manufacturing Technology
URI: http://scholarbank.nus.edu.sg/handle/10635/63144
ISSN: 02683768
DOI: 10.1007/s00170-008-1808-7
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

11
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

10
checked on Nov 21, 2017

Page view(s)

25
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.