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: | , , |
|---|---|
| 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!
|