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

Authors:
Dvir Shabtay
Affiliations:
Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel
Venue:
Computers and Operations Research
Year:
2008

Citing 9
Cited 4

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
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
Two due date assignment problems in scheduling a single machine

Operations Research Letters
Completion time variance minimization on a single machine is difficult

Operations Research Letters

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
Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study three different due date assignment problems in scheduling a single machine which differ from each other based upon the objective function and due date assignment method being used. Two different objective functions are considered. The first is a cost function that includes earliness, tardiness and due date assignment penalties and the second is a function that includes penalties due to the number of tardy jobs and due date assignments. We assume that the earliness, tardiness and due date assignment penalties are continuous and non-decreasing functions of the corresponding duration. The goal is to minimize each objective function for two different due date assignment methods. The first is a method in which the assigned due dates are restricted to be equal while the second is a method that allows us to assign different due dates to different jobs.