Minimizing mean squared deviation of completion times with maximum tardiness constraint

Jong Hwa Seo, Chae Bogk Kim, Dong Hoon Lee

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We consider a nonpreemptive single-machine scheduling problem to minimize mean squared deviation of job completion times about a common due date with maximum tardiness constraint (MSD/Tmax problem), where the common due date is large enough so that it does not constrain the minimization of MSD. The MSD/Tmax problem is classified into three cases according to the value of maximum allowable tardiness Δ: Δ-unconstrained, Δ-constrained and tightly Δ-constrained cases. It is shown that the Δ-unconstrained MSD/Tmax problem is equivalent to the unconstrained MSD problem and that the tightly Δ-constrained MSD/Tmax problem with common due date d is equivalent to the tightly constrained MSD problem with common due date Δ. We also provide bounds to decide when the MSD/Tmax problem is Δ-unconstrained or Δ-constrained. Then a solution procedure to the MSD/Tmax problem is presented with several examples.

Original languageEnglish
Pages (from-to)95-104
Number of pages10
JournalEuropean Journal of Operational Research
Volume129
Issue number1
DOIs
Publication statusPublished - 2001 Feb 15
Externally publishedYes

Fingerprint

Tardiness
Completion Time
Deviation
Scheduling
Common Due Date
Single Machine Scheduling
Due dates
time
Scheduling Problem
scheduling
Minimise

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Modelling and Simulation
  • Transportation

Cite this

Minimizing mean squared deviation of completion times with maximum tardiness constraint. / Seo, Jong Hwa; Kim, Chae Bogk; Lee, Dong Hoon.

In: European Journal of Operational Research, Vol. 129, No. 1, 15.02.2001, p. 95-104.

Research output: Contribution to journalArticle

@article{7333f72bcf8f463e8b86d61cf5999909,
title = "Minimizing mean squared deviation of completion times with maximum tardiness constraint",
abstract = "We consider a nonpreemptive single-machine scheduling problem to minimize mean squared deviation of job completion times about a common due date with maximum tardiness constraint (MSD/Tmax problem), where the common due date is large enough so that it does not constrain the minimization of MSD. The MSD/Tmax problem is classified into three cases according to the value of maximum allowable tardiness Δ: Δ-unconstrained, Δ-constrained and tightly Δ-constrained cases. It is shown that the Δ-unconstrained MSD/Tmax problem is equivalent to the unconstrained MSD problem and that the tightly Δ-constrained MSD/Tmax problem with common due date d is equivalent to the tightly constrained MSD problem with common due date Δ. We also provide bounds to decide when the MSD/Tmax problem is Δ-unconstrained or Δ-constrained. Then a solution procedure to the MSD/Tmax problem is presented with several examples.",
author = "Seo, {Jong Hwa} and Kim, {Chae Bogk} and Lee, {Dong Hoon}",
year = "2001",
month = "2",
day = "15",
doi = "10.1016/S0377-2217(99)00425-7",
language = "English",
volume = "129",
pages = "95--104",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Minimizing mean squared deviation of completion times with maximum tardiness constraint

AU - Seo, Jong Hwa

AU - Kim, Chae Bogk

AU - Lee, Dong Hoon

PY - 2001/2/15

Y1 - 2001/2/15

N2 - We consider a nonpreemptive single-machine scheduling problem to minimize mean squared deviation of job completion times about a common due date with maximum tardiness constraint (MSD/Tmax problem), where the common due date is large enough so that it does not constrain the minimization of MSD. The MSD/Tmax problem is classified into three cases according to the value of maximum allowable tardiness Δ: Δ-unconstrained, Δ-constrained and tightly Δ-constrained cases. It is shown that the Δ-unconstrained MSD/Tmax problem is equivalent to the unconstrained MSD problem and that the tightly Δ-constrained MSD/Tmax problem with common due date d is equivalent to the tightly constrained MSD problem with common due date Δ. We also provide bounds to decide when the MSD/Tmax problem is Δ-unconstrained or Δ-constrained. Then a solution procedure to the MSD/Tmax problem is presented with several examples.

AB - We consider a nonpreemptive single-machine scheduling problem to minimize mean squared deviation of job completion times about a common due date with maximum tardiness constraint (MSD/Tmax problem), where the common due date is large enough so that it does not constrain the minimization of MSD. The MSD/Tmax problem is classified into three cases according to the value of maximum allowable tardiness Δ: Δ-unconstrained, Δ-constrained and tightly Δ-constrained cases. It is shown that the Δ-unconstrained MSD/Tmax problem is equivalent to the unconstrained MSD problem and that the tightly Δ-constrained MSD/Tmax problem with common due date d is equivalent to the tightly constrained MSD problem with common due date Δ. We also provide bounds to decide when the MSD/Tmax problem is Δ-unconstrained or Δ-constrained. Then a solution procedure to the MSD/Tmax problem is presented with several examples.

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

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

U2 - 10.1016/S0377-2217(99)00425-7

DO - 10.1016/S0377-2217(99)00425-7

M3 - Article

AN - SCOPUS:0035254259

VL - 129

SP - 95

EP - 104

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -