Efficient sub-optimal earliest deadline with local search job shop scheduling algorithm

Chee, Keong Lee and I. K. T., Tan (2010) Efficient sub-optimal earliest deadline with local search job shop scheduling algorithm. In: 2010 IEEE International Conference on Advanced Management Science (ICAMS). IEEE, 484 -488. ISBN 978-1-4244-6931-4

[img] Text
05552968.pdf - Published Version
Restricted to Repository staff only

Download (401kB)
Official URL: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumb...


Minimizing the turnaround time for job orders on the manufacturing shop floor can raise the utilization and efficiencies of the resources in an organization. In some cases, it can reduce capital expenditure for more machines whilst handling the same amount of work load. The key is to schedule the individual processes in the job order to reduce slack time whilst adhering to the process ordering constraints of each job order. Using an algorithm to schedule processes with the earliest deadline is a simple and quick way to create a sub-optimal job shop schedule. However this gives rise to gaps in the machine utilization, which can be exploited to further reduce the overall turnaround time. This paper presents an additional step through the local search mechanism which does not cost much more computationally to the overall algorithm.

Item Type: Book Section
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Information Science and Technology (FIST)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 06 Nov 2013 01:51
Last Modified: 06 Nov 2013 01:51
URI: http://shdl.mmu.edu.my/id/eprint/4367

Actions (login required)

View Item View Item