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

Research output: Contribution to journalArticle

52 Citations (Scopus)

Abstract

This paper addresses the job shop-scheduling problem with due date-based objectives including the tardy rate, mean tardiness and maximum tardiness. The focused approach is the dispatching rules. Eighteen dispatching rules are selected from the literature, and their features and design concepts are discussed. Then a dispatching rule is proposed with the goal of achieving a good and balanced performance when more than one objective is concerned at the same time. First, three good design principles are recognized from the existing rules. Second, it introduces a due date extension procedure to solve a problem of negative allowance time. Third, a job candidate reduction mechanism is developed to make the rule computationally efficient. Lastly, a comprehensive simulation study is conducted with the 18 existing rules as the benchmarks. The experimental results verify the superiority of the proposed rule, especially on the tardy rate and mean tardiness.

Original languageEnglish
Pages (from-to)3245-3262
Number of pages18
JournalInternational Journal of Production Research
Volume45
Issue number14
DOIs
Publication statusPublished - 2007 Jul 1

Fingerprint

Due dates
Dispatching rules
Tardiness
Job shop scheduling
Simulation study
Benchmark
Design principles

Keywords

  • Dispatching rules
  • Due dates
  • Jop shop
  • Scheduling

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

Using dispatching rules for job shop scheduling with due date-based objectives. / Chiang, Tsung-Che; Fu, L. C.

In: International Journal of Production Research, Vol. 45, No. 14, 01.07.2007, p. 3245-3262.

Research output: Contribution to journalArticle

@article{13f9200b41c048d189efabfd0713d365,
title = "Using dispatching rules for job shop scheduling with due date-based objectives",
abstract = "This paper addresses the job shop-scheduling problem with due date-based objectives including the tardy rate, mean tardiness and maximum tardiness. The focused approach is the dispatching rules. Eighteen dispatching rules are selected from the literature, and their features and design concepts are discussed. Then a dispatching rule is proposed with the goal of achieving a good and balanced performance when more than one objective is concerned at the same time. First, three good design principles are recognized from the existing rules. Second, it introduces a due date extension procedure to solve a problem of negative allowance time. Third, a job candidate reduction mechanism is developed to make the rule computationally efficient. Lastly, a comprehensive simulation study is conducted with the 18 existing rules as the benchmarks. The experimental results verify the superiority of the proposed rule, especially on the tardy rate and mean tardiness.",
keywords = "Dispatching rules, Due dates, Jop shop, Scheduling",
author = "Tsung-Che Chiang and Fu, {L. C.}",
year = "2007",
month = "7",
day = "1",
doi = "10.1080/00207540600786715",
language = "English",
volume = "45",
pages = "3245--3262",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "14",

}

TY - JOUR

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

AU - Chiang, Tsung-Che

AU - Fu, L. C.

PY - 2007/7/1

Y1 - 2007/7/1

N2 - This paper addresses the job shop-scheduling problem with due date-based objectives including the tardy rate, mean tardiness and maximum tardiness. The focused approach is the dispatching rules. Eighteen dispatching rules are selected from the literature, and their features and design concepts are discussed. Then a dispatching rule is proposed with the goal of achieving a good and balanced performance when more than one objective is concerned at the same time. First, three good design principles are recognized from the existing rules. Second, it introduces a due date extension procedure to solve a problem of negative allowance time. Third, a job candidate reduction mechanism is developed to make the rule computationally efficient. Lastly, a comprehensive simulation study is conducted with the 18 existing rules as the benchmarks. The experimental results verify the superiority of the proposed rule, especially on the tardy rate and mean tardiness.

AB - This paper addresses the job shop-scheduling problem with due date-based objectives including the tardy rate, mean tardiness and maximum tardiness. The focused approach is the dispatching rules. Eighteen dispatching rules are selected from the literature, and their features and design concepts are discussed. Then a dispatching rule is proposed with the goal of achieving a good and balanced performance when more than one objective is concerned at the same time. First, three good design principles are recognized from the existing rules. Second, it introduces a due date extension procedure to solve a problem of negative allowance time. Third, a job candidate reduction mechanism is developed to make the rule computationally efficient. Lastly, a comprehensive simulation study is conducted with the 18 existing rules as the benchmarks. The experimental results verify the superiority of the proposed rule, especially on the tardy rate and mean tardiness.

KW - Dispatching rules

KW - Due dates

KW - Jop shop

KW - Scheduling

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

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

U2 - 10.1080/00207540600786715

DO - 10.1080/00207540600786715

M3 - Article

AN - SCOPUS:34249341750

VL - 45

SP - 3245

EP - 3262

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 14

ER -