On optimal common due-date determination

Research output: Journal article publicationJournal articleAcademic researchpeer-review

6 Citations (Scopus)

Abstract

Given a set of n independent jobs to be processed on a single machine, the problem is to determine the optimal constant flow allowance for the CON due-date assignment method and the optimal job sequence to minimize an average missed due-date cost. A linear programming formulation of the problem is proposed and the optimal due-date is obtained by solving the LP dual problem. It is shown that the optimal job sequence can be determined analytically only under a special circumstance. Finally, a numerical example is given to demonstrate how the results can be applied to find the optimal solutions.
Original languageEnglish
Pages (from-to)39-43
Number of pages5
JournalIMA Journal of Management Mathematics
Volume1
Issue number1
DOIs
Publication statusPublished - 1 Dec 1986
Externally publishedYes

ASJC Scopus subject areas

  • Management Information Systems
  • Modelling and Simulation
  • Economics, Econometrics and Finance(all)
  • Strategy and Management
  • Management Science and Operations Research
  • Applied Mathematics

Cite this