Optimal constant due-date determination and sequencing of n jobs on a single machine

Research output: Journal article publicationJournal articleAcademic researchpeer-review

12 Citations (Scopus)

Abstract

This paper considers due-date determination and sequencing of n jobs on a single-machine where each job is given a constant flow allowance. The objective is to determine the optimal value of the flow allowance and the optimal job sequence to minimize a cost function based on the flow allowance and the job earliness and tardiness values. We first propose a linear programming (LP) formulation of the problem and then derive the optimal constant flow allowance via considering the LP dual problem. We show that the optimal constant due-date value is independent of job sequence. After the theoretical treatment, a numerical example is presented for discussion.
Original languageEnglish
Pages (from-to)259-261
Number of pages3
JournalInternational Journal of Production Economics
Volume22
Issue number3
DOIs
Publication statusPublished - 1 Jan 1991
Externally publishedYes

ASJC Scopus subject areas

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

Cite this