A note: Minmax due-date assignment problem with lead-time cost

Baruch Mor, Gur Mosheiov*, Dvir Shabtay

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


All three major classes of due-date assignment models (CON, SLK and DIF) have been solved in the literature for a minsum setting, and only two of them (CON and SLK) have been solved for a minmax setting. In this note we introduce a solution for the missing minmax model of DIF. Specifically, we study a single-machine scheduling and due-date assignment problem, in which job-dependent lead-times are considered. Three cost components for each job are assumed: earliness cost, tardiness cost, and the cost for delaying the due-date (beyond its lead-time). The goal is to schedule the jobs and to assign due-dates, such that the maximum cost among all the jobs is minimized. We introduce an O(nlog2n) solution algorithm (where n is the number of jobs).

Original languageAmerican English
Pages (from-to)2161-2164
Number of pages4
JournalComputers and Operations Research
Issue number8
StatePublished - Aug 2013

Bibliographical note

Funding Information:
This paper was supported in part by The Charles Rosen Chair of Management and the Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.


  • Scheduling Single machine Due-date assignment Minmax Lead-time


Dive into the research topics of 'A note: Minmax due-date assignment problem with lead-time cost'. Together they form a unique fingerprint.

Cite this