Vol.11, No.2, May 2022.                                                                                                                                                                                   ISSN: 2217-8309

                                                                                                                                                                                                                        eISSN: 2217-8333


TEM Journal



Association for Information Communication Technology Education and Science

Scheduling Single Machine Problem to Minimize Completion Time


Yasothei Suppiah, Thangavel Bhuvaneswari, Pang Shen Yee, Ng Wei Yue, Chan Mun Horng


© 2022 Yasothei Suppiah, published by UIKTEN. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License. (CC BY-NC-ND 4.0)


Citation Information: TEM Journal. Volume 11, Issue 2, Pages 552-556, ISSN 2217-8309, DOI: 10.18421/TEM112-08, May 2022.


Received: 07 February 2022.

Revised:   27 March 2022.
Accepted: 01 April 2022.
Published: 27 May 2022.




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.


Keywords –scheduling, tabu search, genetic algorithm, batch, completion time.



Full text PDF >  



Copyright © 2022 UIKTEN
Copyright licence: All articles are licenced via Creative Commons CC BY-NC-ND 4.0 licence