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

Baruch Mor; Gur Mosheiov; Dvir Shabtay

doi:10.1016/j.cor.2013.03.004

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

Baruch Mor, Gur Mosheiov, Dvir Shabtay

Department of Industrial Engineering and Management

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

Abstract

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(n^log2n) solution algorithm (where n is the number of jobs).

Original language	English
Pages (from-to)	2161-2164
Number of pages	4
Journal	Computers and Operations Research
Volume	40
Issue number	8
DOIs	https://doi.org/10.1016/j.cor.2013.03.004
State	Published - 1 Aug 2013

Keywords

Scheduling Single machine Due-date assignment Minmax Lead-time

ASJC Scopus subject areas

General Computer Science
Modeling and Simulation
Management Science and Operations Research

Access to Document

10.1016/j.cor.2013.03.004

Cite this

@article{dfa6e15acf1144e583b8ed8a06e594cb,

title = "A note: Minmax due-date assignment problem with lead-time cost",

abstract = "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).",

keywords = "Scheduling Single machine Due-date assignment Minmax Lead-time",

author = "Baruch Mor and Gur Mosheiov and Dvir Shabtay",

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.",

year = "2013",

month = aug,

day = "1",

doi = "10.1016/j.cor.2013.03.004",

language = "English",

volume = "40",

pages = "2161--2164",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd.",

number = "8",

}

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/1

Y1 - 2013/8/1

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 - 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 -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this