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

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]

[thumbnail of IJAMT_2004_dy.pdf] PDF
IJAMT_2004_dy.pdf - Published Version
Restricted to Registered users only

Download (203kB)

Abstract

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

Item Type: Citation Index Journal
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments / MOR / COE: Departments > Computer Information Sciences
Depositing User: Assoc Prof Dr Dhanapal Durai Dominic P
Date Deposited: 23 Dec 2010 03:26
Last Modified: 19 Jan 2017 08:27
URI: http://scholars.utp.edu.my/id/eprint/3447

Actions (login required)

View Item
View Item