Single machine MAD/Tmax problem with a common due date

Sung A. Cho, Chae Bogk Kim, Dong Hoon Lee

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Consider a nonpreemptive single-machine scheduling problem which minimizes the MAD with a common due date d subject to the maximum tardiness constraint. This paper divides the MAD/Tmax problem into three categories: Δ-unconstrained, Δ-constrained, and tightly Δ-constrained cases. The exact algorithm to obtain the optimal solution is proposed after computing bounds to decide when the MAD/Tmax problem is Δ-unconstrained or tightly Δ-constrained cases. For the Δ-constrained MAD/Tmax problem, it is shown that the schedule should finish at (d+Δ) or a job should complete at d in the optimal schedule. In order to improve the efficiency of the proposed algorithm, three rules to delete partial sequences are developed. Since the MAD/Tmax problem is NP-complete in ordinary sense, a heuristic algorithm is proposed. In order to improve the schedule generated, the proposed algorithm uses the ideas that (1) in an optimal schedule, the largest job is not always processed first and (2) not all optimal schedules finish at d+Δ. For the obtained schedule and reverse schedule, shift operations and exchange operations are applied in order to improve the quality of solution. Computational results of test problems taken from the literature are shown. There has been many studies on the problems of minimizing the earliness and tardiness penalties simultaneously as JIT production system prevails in many companies in the world. This paper is the first attempt made in studying scheduling problems with the objective of the mean absolute deviation (MAD), subject to the constraint that maximum tardiness is less than or equal to predefined allowance Δ (MAD/Tmax problem).

Original languageEnglish
Pages (from-to)1099-1113
Number of pages15
JournalComputers and Operations Research
Volume29
Issue number8
DOIs
Publication statusPublished - 2002 Jul 1

Fingerprint

Common Due Date
Single Machine
Schedule
Deviation
Tardiness
Scheduling
Heuristic algorithms
Computational complexity
Scheduling Problem
scheduling
Earliness
Single Machine Scheduling
Less than or equal to
Exact Algorithms
Production Systems
Due dates
Single machine
Industry
Heuristic algorithm
Test Problems

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modelling and Simulation
  • Transportation

Cite this

Single machine MAD/Tmax problem with a common due date. / Cho, Sung A.; Kim, Chae Bogk; Lee, Dong Hoon.

In: Computers and Operations Research, Vol. 29, No. 8, 01.07.2002, p. 1099-1113.

Research output: Contribution to journalArticle

Cho, Sung A. ; Kim, Chae Bogk ; Lee, Dong Hoon. / Single machine MAD/Tmax problem with a common due date. In: Computers and Operations Research. 2002 ; Vol. 29, No. 8. pp. 1099-1113.
@article{a379bf32952845ae8c8013f99a0b5d26,
title = "Single machine MAD/Tmax problem with a common due date",
abstract = "Consider a nonpreemptive single-machine scheduling problem which minimizes the MAD with a common due date d subject to the maximum tardiness constraint. This paper divides the MAD/Tmax problem into three categories: Δ-unconstrained, Δ-constrained, and tightly Δ-constrained cases. The exact algorithm to obtain the optimal solution is proposed after computing bounds to decide when the MAD/Tmax problem is Δ-unconstrained or tightly Δ-constrained cases. For the Δ-constrained MAD/Tmax problem, it is shown that the schedule should finish at (d+Δ) or a job should complete at d in the optimal schedule. In order to improve the efficiency of the proposed algorithm, three rules to delete partial sequences are developed. Since the MAD/Tmax problem is NP-complete in ordinary sense, a heuristic algorithm is proposed. In order to improve the schedule generated, the proposed algorithm uses the ideas that (1) in an optimal schedule, the largest job is not always processed first and (2) not all optimal schedules finish at d+Δ. For the obtained schedule and reverse schedule, shift operations and exchange operations are applied in order to improve the quality of solution. Computational results of test problems taken from the literature are shown. There has been many studies on the problems of minimizing the earliness and tardiness penalties simultaneously as JIT production system prevails in many companies in the world. This paper is the first attempt made in studying scheduling problems with the objective of the mean absolute deviation (MAD), subject to the constraint that maximum tardiness is less than or equal to predefined allowance Δ (MAD/Tmax problem).",
keywords = "Earliness, Scheduling, Tardiness",
author = "Cho, {Sung A.} and Kim, {Chae Bogk} and Lee, {Dong Hoon}",
year = "2002",
month = "7",
day = "1",
doi = "10.1016/S0305-0548(00)00107-6",
language = "English",
volume = "29",
pages = "1099--1113",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "8",

}

TY - JOUR

T1 - Single machine MAD/Tmax problem with a common due date

AU - Cho, Sung A.

AU - Kim, Chae Bogk

AU - Lee, Dong Hoon

PY - 2002/7/1

Y1 - 2002/7/1

N2 - Consider a nonpreemptive single-machine scheduling problem which minimizes the MAD with a common due date d subject to the maximum tardiness constraint. This paper divides the MAD/Tmax problem into three categories: Δ-unconstrained, Δ-constrained, and tightly Δ-constrained cases. The exact algorithm to obtain the optimal solution is proposed after computing bounds to decide when the MAD/Tmax problem is Δ-unconstrained or tightly Δ-constrained cases. For the Δ-constrained MAD/Tmax problem, it is shown that the schedule should finish at (d+Δ) or a job should complete at d in the optimal schedule. In order to improve the efficiency of the proposed algorithm, three rules to delete partial sequences are developed. Since the MAD/Tmax problem is NP-complete in ordinary sense, a heuristic algorithm is proposed. In order to improve the schedule generated, the proposed algorithm uses the ideas that (1) in an optimal schedule, the largest job is not always processed first and (2) not all optimal schedules finish at d+Δ. For the obtained schedule and reverse schedule, shift operations and exchange operations are applied in order to improve the quality of solution. Computational results of test problems taken from the literature are shown. There has been many studies on the problems of minimizing the earliness and tardiness penalties simultaneously as JIT production system prevails in many companies in the world. This paper is the first attempt made in studying scheduling problems with the objective of the mean absolute deviation (MAD), subject to the constraint that maximum tardiness is less than or equal to predefined allowance Δ (MAD/Tmax problem).

AB - Consider a nonpreemptive single-machine scheduling problem which minimizes the MAD with a common due date d subject to the maximum tardiness constraint. This paper divides the MAD/Tmax problem into three categories: Δ-unconstrained, Δ-constrained, and tightly Δ-constrained cases. The exact algorithm to obtain the optimal solution is proposed after computing bounds to decide when the MAD/Tmax problem is Δ-unconstrained or tightly Δ-constrained cases. For the Δ-constrained MAD/Tmax problem, it is shown that the schedule should finish at (d+Δ) or a job should complete at d in the optimal schedule. In order to improve the efficiency of the proposed algorithm, three rules to delete partial sequences are developed. Since the MAD/Tmax problem is NP-complete in ordinary sense, a heuristic algorithm is proposed. In order to improve the schedule generated, the proposed algorithm uses the ideas that (1) in an optimal schedule, the largest job is not always processed first and (2) not all optimal schedules finish at d+Δ. For the obtained schedule and reverse schedule, shift operations and exchange operations are applied in order to improve the quality of solution. Computational results of test problems taken from the literature are shown. There has been many studies on the problems of minimizing the earliness and tardiness penalties simultaneously as JIT production system prevails in many companies in the world. This paper is the first attempt made in studying scheduling problems with the objective of the mean absolute deviation (MAD), subject to the constraint that maximum tardiness is less than or equal to predefined allowance Δ (MAD/Tmax problem).

KW - Earliness

KW - Scheduling

KW - Tardiness

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

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

U2 - 10.1016/S0305-0548(00)00107-6

DO - 10.1016/S0305-0548(00)00107-6

M3 - Article

VL - 29

SP - 1099

EP - 1113

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 8

ER -