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

Authors:
Dvir Shabtay;George Steiner;Liron Yedidsion
Affiliations:
Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Operations Management Area, Michael G. DeGroote School of Business, McMaster University, Hamilton, Ontario, Canada;Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, Haifa, Israel
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 16
Cited 1

Combinatorial optimization: algorithms and complexity

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

Management Science
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
Approximation algorithms for minimizing the total weighted tardiness on a single machine

Theoretical Computer Science
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

Theoretical Computer Science
Due date assignments and scheduling a single machine with a general earliness/tardiness cost function

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

Journal of Scheduling
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective

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

Operations Research Letters
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

Operations Research Letters

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

Computers and Operations Research

Quantified Score

Hi-index	0.04

Visualization

Abstract

We study bicriteria problems of minimizing maximum tardiness and total due date assignment cost in various scheduling environments. We assume that each job can be assigned a different due date without any restriction, and that each due date assignment cost is a non-decreasing function of the quoted due date. We settle the complexity of most of the problems studied by either proving that they are NP-hard or finding a polynomial time solution for them. We also include approximation and non-approximability results for several parallel-machine problems.