Single machine scheduling with symmetric earliness and tardiness penalties

Jose Antonio Ventura, Sanjay Radhakrishnan

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

This research focuses on scheduling jobs with varying processing times and distinct due dates on a single machine subject to earliness and tardiness penalties. Hence, this work will find application in a just-in-time (JIT) production environment. The scheduling problem is formulated as a 0-1 linear integer program with three sets of constraints, where the objective is to minimize the sum of the absolute deviations between job completion times and their respective due dates. The first two sets of constraints are equivalent to the supply and demand constraints of an assignment problem. The third set, which represents the process time non-overlap constraints, is relaxed to form the Lagrangian dual problem. The dual problem is then solved using the subgradient algorithm. Efficient heuristics have also been developed in this work to yield initial primal feasible solutions and to convert primal infeasible solutions to feasibility. The computational results show that the relative deviation from optimality obtained by the subgradient algorithm is less than 3% for problem sizes varying from 10 to 100 jobs.

Original languageEnglish (US)
Pages (from-to)598-612
Number of pages15
JournalEuropean Journal of Operational Research
Volume144
Issue number3
DOIs
StatePublished - Feb 1 2003

Fingerprint

Earliness
Single Machine Scheduling
Tardiness
scheduling
Penalty
penalty
Just in time production
Scheduling
Subgradient
Due Dates
Dual Problem
Deviation
just-in-time production
Job Scheduling
Integer Program
Single Machine
Completion Time
Assignment Problem
Processing
Linear Program

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this

@article{98009ea46a05496fac69a39bb4cd97e4,
title = "Single machine scheduling with symmetric earliness and tardiness penalties",
abstract = "This research focuses on scheduling jobs with varying processing times and distinct due dates on a single machine subject to earliness and tardiness penalties. Hence, this work will find application in a just-in-time (JIT) production environment. The scheduling problem is formulated as a 0-1 linear integer program with three sets of constraints, where the objective is to minimize the sum of the absolute deviations between job completion times and their respective due dates. The first two sets of constraints are equivalent to the supply and demand constraints of an assignment problem. The third set, which represents the process time non-overlap constraints, is relaxed to form the Lagrangian dual problem. The dual problem is then solved using the subgradient algorithm. Efficient heuristics have also been developed in this work to yield initial primal feasible solutions and to convert primal infeasible solutions to feasibility. The computational results show that the relative deviation from optimality obtained by the subgradient algorithm is less than 3{\%} for problem sizes varying from 10 to 100 jobs.",
author = "Ventura, {Jose Antonio} and Sanjay Radhakrishnan",
year = "2003",
month = "2",
day = "1",
doi = "10.1016/S0377-2217(02)00163-7",
language = "English (US)",
volume = "144",
pages = "598--612",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "3",

}

Single machine scheduling with symmetric earliness and tardiness penalties. / Ventura, Jose Antonio; Radhakrishnan, Sanjay.

In: European Journal of Operational Research, Vol. 144, No. 3, 01.02.2003, p. 598-612.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Single machine scheduling with symmetric earliness and tardiness penalties

AU - Ventura, Jose Antonio

AU - Radhakrishnan, Sanjay

PY - 2003/2/1

Y1 - 2003/2/1

N2 - This research focuses on scheduling jobs with varying processing times and distinct due dates on a single machine subject to earliness and tardiness penalties. Hence, this work will find application in a just-in-time (JIT) production environment. The scheduling problem is formulated as a 0-1 linear integer program with three sets of constraints, where the objective is to minimize the sum of the absolute deviations between job completion times and their respective due dates. The first two sets of constraints are equivalent to the supply and demand constraints of an assignment problem. The third set, which represents the process time non-overlap constraints, is relaxed to form the Lagrangian dual problem. The dual problem is then solved using the subgradient algorithm. Efficient heuristics have also been developed in this work to yield initial primal feasible solutions and to convert primal infeasible solutions to feasibility. The computational results show that the relative deviation from optimality obtained by the subgradient algorithm is less than 3% for problem sizes varying from 10 to 100 jobs.

AB - This research focuses on scheduling jobs with varying processing times and distinct due dates on a single machine subject to earliness and tardiness penalties. Hence, this work will find application in a just-in-time (JIT) production environment. The scheduling problem is formulated as a 0-1 linear integer program with three sets of constraints, where the objective is to minimize the sum of the absolute deviations between job completion times and their respective due dates. The first two sets of constraints are equivalent to the supply and demand constraints of an assignment problem. The third set, which represents the process time non-overlap constraints, is relaxed to form the Lagrangian dual problem. The dual problem is then solved using the subgradient algorithm. Efficient heuristics have also been developed in this work to yield initial primal feasible solutions and to convert primal infeasible solutions to feasibility. The computational results show that the relative deviation from optimality obtained by the subgradient algorithm is less than 3% for problem sizes varying from 10 to 100 jobs.

UR - http://www.scopus.com/inward/record.url?scp=0037290066&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037290066&partnerID=8YFLogxK

U2 - 10.1016/S0377-2217(02)00163-7

DO - 10.1016/S0377-2217(02)00163-7

M3 - Article

AN - SCOPUS:0037290066

VL - 144

SP - 598

EP - 612

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -