TY - JOUR
T1 - A note
T2 - Minmax due-date assignment problem with lead-time cost
AU - Mor, Baruch
AU - Mosheiov, Gur
AU - Shabtay, Dvir
N1 - 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.
PY - 2013/8
Y1 - 2013/8
N2 - 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).
AB - 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).
KW - Scheduling Single machine Due-date assignment Minmax Lead-time
UR - http://www.scopus.com/inward/record.url?scp=84876966648&partnerID=8YFLogxK
U2 - 10.1016/j.cor.2013.03.004
DO - 10.1016/j.cor.2013.03.004
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84876966648
SN - 0305-0548
VL - 40
SP - 2161
EP - 2164
JO - Computers and Operations Research
JF - Computers and Operations Research
IS - 8
ER -