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...
Saved in:
Main Authors: | Dominic P, Dhanapal Durai, Kaliamoorthy, S, Murugan, R |
---|---|
Format: | Citation Index Journal |
Published: |
springer
2004
|
Subjects: | |
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!
|
Similar Items
-
Efficient dispatching rules for dynamic job shop scheduling
by: P.D.D., Dominic, et al.
Published: (2004) -
A comparative representation approach to modern
heuristic search methods in a job shop
by: Dominic P, Dhanapal Durai, et al.
Published: (2008) -
Grid jobs scheduling improvement using priority rules and backfilling
by: Azmi, Z. R. M., et al.
Published: (2011) -
A review on job scheduling technique in cloud computing and priority rule based intelligent framework
by: Murad, Saydul Akbar, et al.
Published: (2022) -
Comparative study on job scheduling using priority rule and machine learning
by: Murad, Saydul Akbar, et al.
Published: (2021)