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

Authors:
Baruch Mor;Gur Mosheiov;Dvir Shabtay
Affiliations:
-;-;-
Venue:
Computers and Operations Research
Year:
2013

Citing 15
Cited 0

An O(n log2n) algorithm for the maximum weighted tardiness problem

Information Processing Letters
Sequencing with earliness and tardiness penalties: a review

Operations Research
Optimal due date determination and sequencing of n jobs on a single machine using the SLK method

Computers in Industry
Earliness penalties on a single machine subject to precedence constraints

Computers and Operations Research
Single machine scheduling with assignable due dates

Discrete Applied Mathematics
A note on the SPT heuristic for solving scheduling problems with generalized due dates

Computers and Operations Research
Optimal due date assignment in multi-machine scheduling environments

Journal of Scheduling
Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine

Manufacturing & Service Operations Management
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments

Discrete Applied Mathematics
Single machine common flow allowance scheduling with a rate-modifying activity

Computers and Industrial Engineering
Two-machine flow-shop scheduling with rejection

Computers and Operations Research
Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs

Computers and Operations Research
Soft Due Window Assignment and Scheduling on Parallel Machines

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Two due date assignment problems in scheduling a single machine

Operations Research Letters
A note on "Two-machine flow-shop scheduling with rejection" and its link with flow-shop scheduling and common due date assignment

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

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