Scheduling Single Machine Problem to Minimize Completion Time

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 proble...

Full description

Saved in:
Bibliographic Details
Published in:TEM Journal 2022-05, Vol.11 (2), p.552-556
Main Authors: Suppiah, Yasothei, Bhuvaneswari, Thangavel, Shen Yee, Pang, Wei Yue, Ng, Mun Horng, Chan
Format: Article
Language:English
Subjects:
Business Economy / Management
Completion time
Genetic algorithms
Heuristic
Linear programming
Multimedia
Mutation
Neighborhoods
Population
Production planning
Schedules
Scheduling
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2217-8309
2217-8333
DOI:10.18421/TEM112-08