Optimal due date assignment in multi-machine scheduling environments

Authors:
Dvir Shabtay;George Steiner
Affiliations:
Management Science and Information Systems Area, Michael G. DeGroote School of Business, McMaster University, Hamilton, Canada;Management Science and Information Systems Area, Michael G. DeGroote School of Business, McMaster University, Hamilton, Canada
Venue:
Journal of Scheduling
Year:
2008

Citing 12
Cited 4

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Minimizing mean squared deviation of completion times about a common due date

Management Science
Sequencing with earliness and tardiness penalties: a review

Operations Research
Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Parallel machine scheduling to minimize costs for earliness and number of tardy jobs

Discrete Applied Mathematics - Special issue on new frontiers in the theory and practice of combinatorial optimization: applications in manufacturing and VLSI design
Batch scheduling and common due-date assignment on a single machine

Discrete Applied Mathematics
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
A common due-date assignment problem on parallel identical machines

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness

Journal of Heuristics
A note on a due-date assignment on a two-machine flow-shop

Computers and Operations Research
Two due date assignment problems in scheduling a single machine

Operations Research Letters

Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments

Discrete Applied Mathematics
Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs

Computers and Operations Research
Scheduling with due date assignment under special conditions on job processing

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

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study two due date assignment problems in various multi-machine scheduling environments. We assume that each job can be assigned an arbitrary non-negative due date, but longer due dates have higher cost. The first problem is to minimize a cost function, which includes earliness, tardiness and due date assignment costs. In the second problem, we minimize an objective function which includes the number of tardy jobs and due date assignment costs. We settle the complexity of many of these problems by either showing that they are $\mathcal{NP}$ -hard or by providing a polynomial time solution for them. We also include approximation and non-approximability results for several parallel-machine problems.