A Comparison of Job Shop Dispatching Rules Using a Total Cost Criterion
Recent research shows existing dispatching rules, proposed for minimizing the total cost, do not perform better than the Critical Ratio rule. New dispatching rules are, therefore, proposed in this paper and are shown to perform significantly better than existing dispatching rules. Under certain cond...
Saved in:
Main Authors: | Yang, Kum Khiong, Sum, C. C. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
1994
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/2272 https://search.ebscohost.com/login.aspx?direct=true&db=buh&AN=5785364&site=ehost-live |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Dynamic selection of dispatching rules for job shop scheduling
by: Subramaniam, V., et al.
Published: (2014) -
A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem
by: Nguyen, S., et al.
Published: (2014) -
Learning iterative dispatching rules for job shop scheduling with genetic programming
by: Nguyen, S., et al.
Published: (2014) -
Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems
by: Zhou, R., et al.
Published: (2014) -
An Evaluation of Flexible Workday Policies in Job Shops
by: Yang, Kum Khiong, et al.
Published: (2002)