Single-machine earliness-tardiness scheduling about a common due date with tolerances

Michael X. Weng, Jose Antonio Ventura

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

In this paper the problem of minimizing the mean absolute deviation (MAD) of job completion times about a given common due date with different sizes of tolerance in an n-job, single-machine scheduling environment is considered. We describe some optimality conditions and show that the problem is NP-complete. A heuristic algorithm is proposed to find an approximate solution to the problem. A pseudo-polynomial dynamic programming algorithm is also proposed to optimally solve the problem if the agreement condition defined in the paper holds. The dynamic programming algorithm can also be used to find a lower bound for the problem by adjusting the tolerances of some jobs. An example is provided to illustrate the proposed methods. A computational study on randomly generated test problems is conducted to investigate the performance of the proposed heuristic and the quality of lower bounds generated by the dynamic programming method. Computational results are reported.

Original languageEnglish (US)
Pages (from-to)217-227
Number of pages11
JournalInternational Journal of Production Economics
Volume42
Issue number3
DOIs
StatePublished - Apr 1 1996

Fingerprint

Dynamic programming
Scheduling
Heuristic algorithms
Computational complexity
Polynomials
Tardiness
Single machine
Due dates
Tolerance
Lower bounds

All Science Journal Classification (ASJC) codes

  • Business, Management and Accounting(all)
  • Economics and Econometrics
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

@article{d2d9bb11ebae421b8b475ca6a30932dc,
title = "Single-machine earliness-tardiness scheduling about a common due date with tolerances",
abstract = "In this paper the problem of minimizing the mean absolute deviation (MAD) of job completion times about a given common due date with different sizes of tolerance in an n-job, single-machine scheduling environment is considered. We describe some optimality conditions and show that the problem is NP-complete. A heuristic algorithm is proposed to find an approximate solution to the problem. A pseudo-polynomial dynamic programming algorithm is also proposed to optimally solve the problem if the agreement condition defined in the paper holds. The dynamic programming algorithm can also be used to find a lower bound for the problem by adjusting the tolerances of some jobs. An example is provided to illustrate the proposed methods. A computational study on randomly generated test problems is conducted to investigate the performance of the proposed heuristic and the quality of lower bounds generated by the dynamic programming method. Computational results are reported.",
author = "Weng, {Michael X.} and Ventura, {Jose Antonio}",
year = "1996",
month = "4",
day = "1",
doi = "10.1016/0925-5273(95)00200-6",
language = "English (US)",
volume = "42",
pages = "217--227",
journal = "International Journal of Production Economics",
issn = "0925-5273",
publisher = "Elsevier",
number = "3",

}

Single-machine earliness-tardiness scheduling about a common due date with tolerances. / Weng, Michael X.; Ventura, Jose Antonio.

In: International Journal of Production Economics, Vol. 42, No. 3, 01.04.1996, p. 217-227.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Single-machine earliness-tardiness scheduling about a common due date with tolerances

AU - Weng, Michael X.

AU - Ventura, Jose Antonio

PY - 1996/4/1

Y1 - 1996/4/1

N2 - In this paper the problem of minimizing the mean absolute deviation (MAD) of job completion times about a given common due date with different sizes of tolerance in an n-job, single-machine scheduling environment is considered. We describe some optimality conditions and show that the problem is NP-complete. A heuristic algorithm is proposed to find an approximate solution to the problem. A pseudo-polynomial dynamic programming algorithm is also proposed to optimally solve the problem if the agreement condition defined in the paper holds. The dynamic programming algorithm can also be used to find a lower bound for the problem by adjusting the tolerances of some jobs. An example is provided to illustrate the proposed methods. A computational study on randomly generated test problems is conducted to investigate the performance of the proposed heuristic and the quality of lower bounds generated by the dynamic programming method. Computational results are reported.

AB - In this paper the problem of minimizing the mean absolute deviation (MAD) of job completion times about a given common due date with different sizes of tolerance in an n-job, single-machine scheduling environment is considered. We describe some optimality conditions and show that the problem is NP-complete. A heuristic algorithm is proposed to find an approximate solution to the problem. A pseudo-polynomial dynamic programming algorithm is also proposed to optimally solve the problem if the agreement condition defined in the paper holds. The dynamic programming algorithm can also be used to find a lower bound for the problem by adjusting the tolerances of some jobs. An example is provided to illustrate the proposed methods. A computational study on randomly generated test problems is conducted to investigate the performance of the proposed heuristic and the quality of lower bounds generated by the dynamic programming method. Computational results are reported.

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

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

U2 - 10.1016/0925-5273(95)00200-6

DO - 10.1016/0925-5273(95)00200-6

M3 - Article

VL - 42

SP - 217

EP - 227

JO - International Journal of Production Economics

JF - International Journal of Production Economics

SN - 0925-5273

IS - 3

ER -