Publication: Single machine scheduling for multi-assembly jobs with preemption
Issued Date
2016-12-27
Resource Type
ISSN
2157362X
21573611
21573611
Other identifier(s)
2-s2.0-85009833692
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
IEEE International Conference on Industrial Engineering and Engineering Management. Vol.2016-December, (2016), 60-64
Suggested Citation
L. Boonma, R. Sirovetnukul, T. Sarttra Single machine scheduling for multi-assembly jobs with preemption. IEEE International Conference on Industrial Engineering and Engineering Management. Vol.2016-December, (2016), 60-64. doi:10.1109/IEEM.2016.7797836 Retrieved from: https://repository.li.mahidol.ac.th/handle/20.500.14594/43270
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
Single machine scheduling for multi-assembly jobs with preemption
Author(s)
Other Contributor(s)
Abstract
© 2016 IEEE. This research proposes a mathematic model for scheduling multi-assembly jobs with uncertain arrival of raw materials or sub-assembly parts and allowable preemption, aiming to minimize tardiness penalty and set-up cost under a single machine. The experimental results show that using the exact algorithm (Branch and Bound) in Lingo 12 is not capable of solve the large-sized problems. Balancing tardiness and set-up cost (BTS) algorithm, therefore, is developed and is capable to solve much larger size of the problem with reasonable solution quality and computational time.