A virtual preemption paradigm for using priority rules to solve job shop scheduling problems

Tsung Che Chiang, Li Chen Fu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

To solve job shop scheduling problems, the priority rule is one of the most popular approach. It has the appeal because of simplicity, efficiency and effectiveness. However, the paradigm conventionally used to apply priority rules has a certain flaw. In this paper, we first point out this flaw and then propose a paradigm to remove it. A rule is also developed to exploit the potential of the new paradigm. The performance of the proposed approach is verified by several simulation experiments. The experimental results are quite satisfactory.

Original languageEnglish
Title of host publicationProceedings of the 2005 IEEE International Conference on Robotics and Automation
Pages3703-3708
Number of pages6
DOIs
Publication statusPublished - 2005 Dec 1
Event2005 IEEE International Conference on Robotics and Automation - Barcelona, Spain
Duration: 2005 Apr 182005 Apr 22

Publication series

NameProceedings - IEEE International Conference on Robotics and Automation
Volume2005
ISSN (Print)1050-4729

Other

Other2005 IEEE International Conference on Robotics and Automation
CountrySpain
CityBarcelona
Period05/4/1805/4/22

Fingerprint

Defects
Experiments
Job shop scheduling

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Cite this

Chiang, T. C., & Fu, L. C. (2005). A virtual preemption paradigm for using priority rules to solve job shop scheduling problems. In Proceedings of the 2005 IEEE International Conference on Robotics and Automation (pp. 3703-3708). [1570684] (Proceedings - IEEE International Conference on Robotics and Automation; Vol. 2005). https://doi.org/10.1109/ROBOT.2005.1570684

A virtual preemption paradigm for using priority rules to solve job shop scheduling problems. / Chiang, Tsung Che; Fu, Li Chen.

Proceedings of the 2005 IEEE International Conference on Robotics and Automation. 2005. p. 3703-3708 1570684 (Proceedings - IEEE International Conference on Robotics and Automation; Vol. 2005).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chiang, TC & Fu, LC 2005, A virtual preemption paradigm for using priority rules to solve job shop scheduling problems. in Proceedings of the 2005 IEEE International Conference on Robotics and Automation., 1570684, Proceedings - IEEE International Conference on Robotics and Automation, vol. 2005, pp. 3703-3708, 2005 IEEE International Conference on Robotics and Automation, Barcelona, Spain, 05/4/18. https://doi.org/10.1109/ROBOT.2005.1570684
Chiang TC, Fu LC. A virtual preemption paradigm for using priority rules to solve job shop scheduling problems. In Proceedings of the 2005 IEEE International Conference on Robotics and Automation. 2005. p. 3703-3708. 1570684. (Proceedings - IEEE International Conference on Robotics and Automation). https://doi.org/10.1109/ROBOT.2005.1570684
Chiang, Tsung Che ; Fu, Li Chen. / A virtual preemption paradigm for using priority rules to solve job shop scheduling problems. Proceedings of the 2005 IEEE International Conference on Robotics and Automation. 2005. pp. 3703-3708 (Proceedings - IEEE International Conference on Robotics and Automation).
@inproceedings{cb8dd490bb154193a59d5730a01930bc,
title = "A virtual preemption paradigm for using priority rules to solve job shop scheduling problems",
abstract = "To solve job shop scheduling problems, the priority rule is one of the most popular approach. It has the appeal because of simplicity, efficiency and effectiveness. However, the paradigm conventionally used to apply priority rules has a certain flaw. In this paper, we first point out this flaw and then propose a paradigm to remove it. A rule is also developed to exploit the potential of the new paradigm. The performance of the proposed approach is verified by several simulation experiments. The experimental results are quite satisfactory.",
author = "Chiang, {Tsung Che} and Fu, {Li Chen}",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/ROBOT.2005.1570684",
language = "English",
isbn = "078038914X",
series = "Proceedings - IEEE International Conference on Robotics and Automation",
pages = "3703--3708",
booktitle = "Proceedings of the 2005 IEEE International Conference on Robotics and Automation",

}

TY - GEN

T1 - A virtual preemption paradigm for using priority rules to solve job shop scheduling problems

AU - Chiang, Tsung Che

AU - Fu, Li Chen

PY - 2005/12/1

Y1 - 2005/12/1

N2 - To solve job shop scheduling problems, the priority rule is one of the most popular approach. It has the appeal because of simplicity, efficiency and effectiveness. However, the paradigm conventionally used to apply priority rules has a certain flaw. In this paper, we first point out this flaw and then propose a paradigm to remove it. A rule is also developed to exploit the potential of the new paradigm. The performance of the proposed approach is verified by several simulation experiments. The experimental results are quite satisfactory.

AB - To solve job shop scheduling problems, the priority rule is one of the most popular approach. It has the appeal because of simplicity, efficiency and effectiveness. However, the paradigm conventionally used to apply priority rules has a certain flaw. In this paper, we first point out this flaw and then propose a paradigm to remove it. A rule is also developed to exploit the potential of the new paradigm. The performance of the proposed approach is verified by several simulation experiments. The experimental results are quite satisfactory.

UR - http://www.scopus.com/inward/record.url?scp=33846136422&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846136422&partnerID=8YFLogxK

U2 - 10.1109/ROBOT.2005.1570684

DO - 10.1109/ROBOT.2005.1570684

M3 - Conference contribution

AN - SCOPUS:33846136422

SN - 078038914X

SN - 9780780389144

T3 - Proceedings - IEEE International Conference on Robotics and Automation

SP - 3703

EP - 3708

BT - Proceedings of the 2005 IEEE International Conference on Robotics and Automation

ER -