Citation

Suppiah, Yasothei and Bhuvaneswari, Thangavel and Pang, Shen Yee and Ng, Wei Yue and Chan, Mun Horng (2022) Scheduling Single Machine Problem to Minimize Completion Time. TEM Journal, 11 (2). pp. 552-556. ISSN 2217-8309

Text 27.pdf - Published Version Restricted to Repository staff only Download (433kB)

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.

Item Type:	Article
Uncontrolled Keywords:	Scheduling, tabu search, genetic algorithm, batch, completion time
Subjects:	T Technology > TS Manufactures > TS155-194 Production management. Operations management
Divisions:	Faculty of Engineering and Technology (FET)
Depositing User:	Ms Nurul Iqtiani Ahmad
Date Deposited:	02 Aug 2022 01:21
Last Modified:	02 Aug 2022 01:21
URII:	http://shdl.mmu.edu.my/id/eprint/10284

Downloads

Edit (login required)