Job shop scheduling problem (JSSP)

• Main Author: Abdullah, Nurul Azma
• Format: Thesis
• Language: English
• Published: 2004
• Subjects: TS Manufactures; TS155-194 Production management. Operations management
• Online Access: http://eprints.uthm.edu.my/7723/1/24p%20NURUL%20AZMA%20ABDULLAH.pdf; http://eprints.uthm.edu.my/7723/
• Institution: Universiti Tun Hussein Onn Malaysia

The job shop scheduling problem is a special case of the general shop in which each job i consists of n tasks Tij with processing times pij (j=l, ... ,m) where Tij has to be processed on machine Mij, and the tasks have to be scheduled in predetermined given order. The job shop problem is to find a feasible schedule, for example, to determine starting times for each task for all jobs to minimize the objective func�tion of the problem. This paper concerns in evaluate the performance of two techniques of dispatching rules which are Earliest Due Date (EDD) and Slack per Remaining Operation (SRO). The schedules are constructed based of these two heuristics. The performance of these techniques open a study on improvement techniques such as metaheuristics techniques which use a local search as a base and most recent technique intro�duced by David E. Joslin and David P. Clements in 1998, Squeaky Wheel which is believed to improve the schedule generated by greedy algorithm technique. Keywords: job shop scheduling problem, dispatching rules, earliest due date, slack per remaining operation, local search, squeaky wheel.