Using dispatching rules for job shop scheduling with due date-based objectives

Tsung Che Chiang*, Li Chen Fu

*Corresponding author for this work

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

4 Citations (Scopus)

Abstract

This paper addresses the job shop scheduling problem with the due date-based objectives including the tardy rate, mean tardiness, and the maximum tardiness. The focused approach is dispatching rules. Sixteen dispatching rules are selected from the literature and used as the benchmarks. Their features and design concepts are also discussed. Then a dispatching rule is proposed with the goal as achieving good and balanced performance when more than one objective is concerned at the same time. The experimental results verified its superiority, especially on the tardy rate and mean tardiness.

Original languageEnglish
Title of host publicationProceedings 2006 IEEE International Conference on Robotics and Automation, ICRA 2006
Pages1426-1431
Number of pages6
DOIs
Publication statusPublished - 2006
Externally publishedYes
Event2006 IEEE International Conference on Robotics and Automation, ICRA 2006 - Orlando, FL, United States
Duration: 2006 May 152006 May 19

Publication series

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

Other

Other2006 IEEE International Conference on Robotics and Automation, ICRA 2006
Country/TerritoryUnited States
CityOrlando, FL
Period2006/05/152006/05/19

Keywords

  • Dispatching rules
  • Job shop scheduling

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'Using dispatching rules for job shop scheduling with due date-based objectives'. Together they form a unique fingerprint.

Cite this