Earliness-tardiness scheduling problems with a common delivery window

Authors:
Surya D. Liman;Sanjay Ramaswamy
Affiliations:
Department of Industrial Engineering, Texas Tech University, Lubbock, TX 79409 USA;Department of Industrial and Management Systems, Penn State University, University Park, PA 16802 USA
Venue:
Operations Research Letters
Year:
1994

Citing 6
Cited 1

Optimal common due-data with limited completion time deviation

Computers and Operations Research
Sequencing with earliness and tardiness penalties: a review

Operations Research
Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date

Computers and Operations Research
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

Operations Research
Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date

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

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

A scheduling problem with one producer and the bargaining counterpart with two producers

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the scheduling of n jobs on a single machine to minimize the sum of weighted earliness and weighted number of tardy jobs given a delivery window. Penalties are not incurred if jobs are completed within the delivery window. The length of this delivery window (which corresponds to the time period within which the customer is willing to take deliveries) is a given constant. We consider two cases of the problem; one where the position of the delivery parameter (restricted window case). We present some optimal properties, prove that the problem (even for the unrestricted window case) is NP-complete, and present dynamic programming algorithms for both cases.