Two due date assignment problems in scheduling a single machine

Authors:
Dvir Shabtay;George Steiner
Affiliations:
Michael G. DeGroote School of Business, Management Science and Information Systems Area, McMaster University, Hamilton, Ontario, Canada L8S 4M4;Michael G. DeGroote School of Business, Management Science and Information Systems Area, McMaster University, Hamilton, Ontario, Canada L8S 4M4
Venue:
Operations Research Letters
Year:
2006

Citing 10
Cited 11

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
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

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
Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
A common due-date assignment problem on parallel identical machines

Computers and Operations Research
A note on a due-date assignment on a two-machine flow-shop

Computers and Operations Research

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
Single machine due date assignment scheduling problem with customer service level in fuzzy environment

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

Discrete Applied Mathematics
Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine

Computers & Mathematics with Applications
Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties

Operations Research
Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost

Computers and Industrial Engineering
A faster algorithm for a due date assignment problem with tardy jobs

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

Journal of Scheduling
A survey on offline scheduling with rejection

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 single-machine scheduling problems: minimizing the sum of weighted earliness, tardiness and due date assignment penalties and minimizing the weighted number of tardy jobs and due date assignment costs. We prove that both problems are strongly NP-hard and give polynomial solutions for some important special cases.