L. BoonmaR. SirovetnukulT. SarttraMahidol University2018-12-112019-03-142018-12-112019-03-142016-12-27IEEE International Conference on Industrial Engineering and Engineering Management. Vol.2016-December, (2016), 60-642157362X215736112-s2.0-85009833692https://repository.li.mahidol.ac.th/handle/20.500.14594/43270© 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.Mahidol UniversityBusiness, Management and AccountingEngineeringConference PaperSCOPUS10.1109/IEEM.2016.7797836