Cover Image

A conflict-based priority dispatching rule and operation-based approaches to job shops

Abstract Job shop scheduling (JSS) problems consist of a set of machines and a collection of jobs to be scheduled. Each job consists of several operations with a specified processing order. In this paper, a job shop model problem is scheduled with the help of the Giffler and Thompson algorithm...

Full description

Saved in:
Bibliographic Details
Main Authors: Dominic P, Dhanapal Durai, Kaliamoorthy, S, Murugan, R
Format: Citation Index Journal
Published: springer 2004
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://eprints.utp.edu.my/3447/1/IJAMT_2004_dy.pdf
http://eprints.utp.edu.my/3447/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utp.eprints.3447
record_format eprints
spelling my.utp.eprints.34472017-01-19T08:27:34Z A conflict-based priority dispatching rule and operation-based approaches to job shops Dominic P, Dhanapal Durai Kaliamoorthy, S Murugan, R QA75 Electronic computers. Computer science Abstract Job shop scheduling (JSS) problems consist of a set of machines and a collection of jobs to be scheduled. Each job consists of several operations with a specified processing order. In this paper, a job shop model problem is scheduled with the help of the Giffler and Thompson algorithm using a priority dispatching rule (PDR). A conflict based PDR is used to schedule the job shop model by using Genetic Algorithms (GAs). An iterative method is applied to the job model to find the optimal conflict-based PDR order and the operation sequence. The same job shop model is also scheduled based on an operation using simulated annealing (SA) and hybrid simulated annealing (HSA). A makespan of the job model is used as an objective. These four methods are considered as different solutions for each problem. A two-way analysis of variance (ANOVA) is applied to test its significance springer 2004 Citation Index Journal PeerReviewed application/pdf http://eprints.utp.edu.my/3447/1/IJAMT_2004_dy.pdf Dominic P, Dhanapal Durai and Kaliamoorthy, S and Murugan, R (2004) A conflict-based priority dispatching rule and operation-based approaches to job shops. [Citation Index Journal] http://eprints.utp.edu.my/3447/
institution Universiti Teknologi Petronas
building UTP Resource Centre
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Petronas
content_source UTP Institutional Repository
url_provider http://eprints.utp.edu.my/
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Dominic P, Dhanapal Durai
Kaliamoorthy, S
Murugan, R
A conflict-based priority dispatching rule and operation-based approaches to job shops
description Abstract Job shop scheduling (JSS) problems consist of a set of machines and a collection of jobs to be scheduled. Each job consists of several operations with a specified processing order. In this paper, a job shop model problem is scheduled with the help of the Giffler and Thompson algorithm using a priority dispatching rule (PDR). A conflict based PDR is used to schedule the job shop model by using Genetic Algorithms (GAs). An iterative method is applied to the job model to find the optimal conflict-based PDR order and the operation sequence. The same job shop model is also scheduled based on an operation using simulated annealing (SA) and hybrid simulated annealing (HSA). A makespan of the job model is used as an objective. These four methods are considered as different solutions for each problem. A two-way analysis of variance (ANOVA) is applied to test its significance
format Citation Index Journal
author Dominic P, Dhanapal Durai
Kaliamoorthy, S
Murugan, R
author_facet Dominic P, Dhanapal Durai
Kaliamoorthy, S
Murugan, R
author_sort Dominic P, Dhanapal Durai
title A conflict-based priority dispatching rule and operation-based approaches to job shops
title_short A conflict-based priority dispatching rule and operation-based approaches to job shops
title_full A conflict-based priority dispatching rule and operation-based approaches to job shops
title_fullStr A conflict-based priority dispatching rule and operation-based approaches to job shops
title_full_unstemmed A conflict-based priority dispatching rule and operation-based approaches to job shops
title_sort conflict-based priority dispatching rule and operation-based approaches to job shops
publisher springer
publishDate 2004
url http://eprints.utp.edu.my/3447/1/IJAMT_2004_dy.pdf
http://eprints.utp.edu.my/3447/
_version_ 1738655267786063872
score 13.211869

Similar Items