Scheduling Single Machine Problem to Minimize Completion Time
Scheduling Single Machine Problem to Minimize Completion Time
Author(s): Yasothei Suppiah, Thangavel Bhuvaneswari, Pang Shen Yee, Ng Wei Yue, Chan Mun HorngSubject(s): Business Economy / Management
Published by: UIKTEN - Association for Information Communication Technology Education and Science
Keywords: scheduling; tabu search; genetic algorithm; batch; completion time;
Summary/Abstract: In this research, a single batch machine scheduling problem with sequence dependent setup time is studied with the aim of minimizing the completion time. This problem has been proven to be NP-hard and therefore, a tabu search algorithm is developed to solve the single batch machine scheduling problem. Furthermore, a genetic algorithm and several dispatching heuristics are also developed to study the capabilities of all the algorithms in providing the average completion time. The computational result reveals that the developed tabu search algorithm is capable of producing a better outcome compared to the other algorithms.
Journal: TEM Journal
- Issue Year: 11/2022
- Issue No: 2
- Page Range: 552-556
- Page Count: 5
- Language: English
