2012 ©
             Publication
Journal Publication
Title of Article Makespan minimization for scheduling unrelated parallel machine with sequence-dependent setup time.  
Date of Acceptance 3 April 2015 
Journal
     Title of Journal EcoProduction. Environmental Issues in Logistics and Manufacturing 
     Standard OTHER () 
     Institute of Journal Springer International Publishing Switzerland 
     ISBN/ISSN 978-3-319-19006-8 
     Volume 2015 
     Issue  
     Month
     Year of Publication 2016 
     Page 253 
     Abstract This chapter presents an investigation of a scheduling problem from hard-disk drive industries. The study focused on the scheduling problem of unrelated parallel machines with sequence-dependent setup time. It specifically focused on the testing process; setup changes of the testing program according to the product type required. So when the demand of customers was greater, the setup of the testing program increased, causing a reduction in production efficiency. The challenge in scheduling the job production sequence was to address a non-polynomial hard problem. The objective was to schedule the job production sequence and allocate the job of the unrelated parallel machines for minimizing the makespan. The problem is formulated as a Mixed Integer Linear Programming (MILP) model and a heuristics algorithm is developed to find near-optimal solution. The results from the heuristics are compared with the optimal solutions to evaluate the effectiveness of the heuristics algorithm. 
     Keyword Scheduling problem, Makespan, Sequence-dependent setup time 
Author
565040039-5 Mr. KARN MOONSRI [Main Author]
Engineering Master's Degree

Reviewing Status มีผู้ประเมินอิสระ 
Status ตีพิมพ์แล้ว 
Level of Publication นานาชาติ 
citation true 
Part of thesis true 
Attach file
Citation 0