Job shop scheduling problem (JSSP)

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

Full description

Saved in:
Bibliographic Details
Main Author: Abdullah, Nurul Azma
Format: Thesis
Language:English
Published: 2004
Subjects:
Online Access:http://eprints.uthm.edu.my/7723/1/24p%20NURUL%20AZMA%20ABDULLAH.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-uthm-ep.7723
record_format uketd_dc
spelling my-uthm-ep.77232022-09-22T07:13:11Z Job shop scheduling problem (JSSP) 2004-10 Abdullah, Nurul Azma TS Manufactures TS155-194 Production management. Operations management 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. 2004-10 Thesis http://eprints.uthm.edu.my/7723/ http://eprints.uthm.edu.my/7723/1/24p%20NURUL%20AZMA%20ABDULLAH.pdf text en public mphil masters University of East Anglia School of Computing Sciences
institution Universiti Tun Hussein Onn Malaysia
collection UTHM Institutional Repository
language English
topic TS Manufactures
TS Manufactures
spellingShingle TS Manufactures
TS Manufactures
Abdullah, Nurul Azma
Job shop scheduling problem (JSSP)
description 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.
format Thesis
qualification_name Master of Philosophy (M.Phil.)
qualification_level Master's degree
author Abdullah, Nurul Azma
author_facet Abdullah, Nurul Azma
author_sort Abdullah, Nurul Azma
title Job shop scheduling problem (JSSP)
title_short Job shop scheduling problem (JSSP)
title_full Job shop scheduling problem (JSSP)
title_fullStr Job shop scheduling problem (JSSP)
title_full_unstemmed Job shop scheduling problem (JSSP)
title_sort job shop scheduling problem (jssp)
granting_institution University of East Anglia
granting_department School of Computing Sciences
publishDate 2004
url http://eprints.uthm.edu.my/7723/1/24p%20NURUL%20AZMA%20ABDULLAH.pdf
_version_ 1747831185860460544