A note on the common due-date assignment problem

Research output: Journal article publicationJournal articleAcademic researchpeer-review

10 Citations (Scopus)

Abstract

This note considers the n-job, one-machine scheduling problem with common due-dates. Previous research has shown that the optimal value of the common due-date coincides with one of the job completion times for a given job sequence. In this note, we propose a linear programming (L.P.) formulation of the problem and obtain the same optimal result via considering the L.P. dual problem.
Original languageEnglish
Pages (from-to)1089-1091
Number of pages3
JournalJournal of the Operational Research Society
Volume37
Issue number11
DOIs
Publication statusPublished - 1 Jan 1986
Externally publishedYes

ASJC Scopus subject areas

  • Management Information Systems
  • Strategy and Management
  • Management Science and Operations Research
  • Marketing

Cite this