Machine scheduling with earliness, tardiness and non-execution penalties

Authors:
Refael Hassin;Mati Shani
Affiliations:
Department of Statistics and Operations Research, School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel;59 Ben-Gurion St., Kfar Saba 44204, Israel and Department of Statistics and Operations Research, School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel
Venue:
Computers and Operations Research
Year:
2005

Citing 15
Cited 4

One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
The single machine early/tardy problem

Management Science
Single machine scheduling to minimize mean absolute lateness: a heuristic solution

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

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
On the minimization of completion time variance with a bicriteria extension

Operations Research
A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights

Computers and Operations Research
The weighted common due date single machine scheduling problem revisited

Computers and Operations Research
Algorithms for minclique scheduling problems

Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties

Mathematics of Operations Research
Computer-Aided complexity classification of combinational problems

Communications of the ACM
A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem

Operations Research
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review

Operations Research
The complexity of scheduling job families about a common due date

Operations Research Letters

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

Journal of Scheduling
Non-approximability of just-in-time scheduling

Journal of Scheduling
Real-time scheduling under time-interval constraints

EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Development of hybrid evolutionary algorithms for production scheduling of hot strip mill

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The study of scheduling problems with earliness-tardiness (E/T) penalties is motivated by the just-in-time (JIT) philosophy, which supports the notion that earliness, as well as tardiness, should be discouraged. In this work, we consider several scheduling problems. We begin by generalizing a known polynomial time algorithm that calculates an optimal schedule for a given sequence of tasks, on a single machine, assuming that the tasks have distinct E/T penalty weights, distinct processing times and distinct due dates. We then present new results to problems, where tasks have common processing times. We also introduce a new concept in E/T scheduling problems, where we allow the non-execution of tasks and consequently, are penalized for each non-executed task. The notion of task's non-execution, coincides with the JIT philosophy in that every violation or a breach of an agreement, should be penalized. We develop polynomial time algorithms for special cases in E/T scheduling problems with non-execution penalties.