@inproceedings{1b8bc72cd5254cc88874e1cdb75769a8,
title = "Single machine scheduling for multi-assembly jobs with preemption",
abstract = "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.",
keywords = "Heuristic Algorithm, Multiassembly jobs, Preemption, Single machine scheduling problem",
author = "L. Boonma and R. Sirovetnukul and T. Sarttra",
note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 International Conference on Industrial Engineering and Engineering Management, IEEM 2016 ; Conference date: 04-12-2016 Through 07-12-2016",
year = "2016",
month = dec,
day = "27",
doi = "10.1109/IEEM.2016.7797836",
language = "English",
series = "IEEE International Conference on Industrial Engineering and Engineering Management",
publisher = "IEEE Computer Society",
pages = "60--64",
booktitle = "2016 International Conference on Industrial Engineering and Engineering Management, IEEM 2016",
}