Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem

• Main Authors: M., Muziana, Kamal Z., Zamli
• Format: Conference or Workshop Item
• Language: English
• Published: 2015
• Subjects: QA76 Computer software
• Online Access: http://umpir.ump.edu.my/id/eprint/8821/1/Development%20of%20Simulated%20Annealing%20Based%20Scheduling%20Algorithm%20for%20Two%20Machines%20Flow%20Shop%20Problem.pdf; http://umpir.ump.edu.my/id/eprint/8821/; http://ocs.utem.edu.my/index.php/mucet2014/MUCET2014/paper/viewFile/8/41
• Institution: Universiti Malaysia Pahang

Flow shop scheduling problems relates the generation of appropriate sequencing for processing of N machines in compliance with given processing sequence orders. Due to costing requirements and time delivery constraints, continuous flow of processing tasks is desired within completion time and with minimum of due date time. Viewing as optimization problem and focusing on two machines, this research aims to develop a new Simulated Annealing based scheduling algorithm, called SA2M, for flow shop problem. The developed algorithm will be compared to the existing Johnson’s algorithm in term of its costs. It is expected that the developed algorithm will perform well if not a par with Johnson’s algorithm