Single machine earliness-tardiness scheduling with resource-dependent release dates

Jose Antonio Ventura, Daecheol Kim, Frederic Garriga

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

This paper deals with the single machine earliness and tardiness scheduling problem with a common due date and resource-dependent release dates. It is assumed that the cost of resource consumption of a job is a non-increasing linear function of the job release date, and this function is common for all jobs. The objective is to find a schedule and job release dates that minimize the total resource consumption, and earliness and tardiness penalties. It is shown that the problem is NP-hard in the ordinary sense even if the due date is unrestricted (the number of jobs that can be scheduled before the due date is unrestricted). An exact dynamic programming (DP) algorithm for small and medium size problems is developed. A heuristic algorithm for large-scale problems is also proposed and the results of a computational comparison between heuristic and optimal solutions are discussed.

Original languageEnglish (US)
Pages (from-to)52-69
Number of pages18
JournalEuropean Journal of Operational Research
Volume142
Issue number1
DOIs
StatePublished - Oct 1 2002

Fingerprint

Earliness-tardiness
Release Dates
Single Machine
Earliness
Tardiness
Due Dates
Scheduling
Resources
Dependent
Heuristic algorithms
Dynamic programming
Common Due Date
Computational complexity
Large-scale Problems
Heuristic algorithm
Linear Function
Dynamic Programming
Penalty
Scheduling Problem
Schedule

All Science Journal Classification (ASJC) codes

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

Cite this

@article{d64944bd2ae4478f821512484567bac5,
title = "Single machine earliness-tardiness scheduling with resource-dependent release dates",
abstract = "This paper deals with the single machine earliness and tardiness scheduling problem with a common due date and resource-dependent release dates. It is assumed that the cost of resource consumption of a job is a non-increasing linear function of the job release date, and this function is common for all jobs. The objective is to find a schedule and job release dates that minimize the total resource consumption, and earliness and tardiness penalties. It is shown that the problem is NP-hard in the ordinary sense even if the due date is unrestricted (the number of jobs that can be scheduled before the due date is unrestricted). An exact dynamic programming (DP) algorithm for small and medium size problems is developed. A heuristic algorithm for large-scale problems is also proposed and the results of a computational comparison between heuristic and optimal solutions are discussed.",
author = "Ventura, {Jose Antonio} and Daecheol Kim and Frederic Garriga",
year = "2002",
month = "10",
day = "1",
doi = "10.1016/S0377-2217(01)00292-2",
language = "English (US)",
volume = "142",
pages = "52--69",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

Single machine earliness-tardiness scheduling with resource-dependent release dates. / Ventura, Jose Antonio; Kim, Daecheol; Garriga, Frederic.

In: European Journal of Operational Research, Vol. 142, No. 1, 01.10.2002, p. 52-69.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Single machine earliness-tardiness scheduling with resource-dependent release dates

AU - Ventura, Jose Antonio

AU - Kim, Daecheol

AU - Garriga, Frederic

PY - 2002/10/1

Y1 - 2002/10/1

N2 - This paper deals with the single machine earliness and tardiness scheduling problem with a common due date and resource-dependent release dates. It is assumed that the cost of resource consumption of a job is a non-increasing linear function of the job release date, and this function is common for all jobs. The objective is to find a schedule and job release dates that minimize the total resource consumption, and earliness and tardiness penalties. It is shown that the problem is NP-hard in the ordinary sense even if the due date is unrestricted (the number of jobs that can be scheduled before the due date is unrestricted). An exact dynamic programming (DP) algorithm for small and medium size problems is developed. A heuristic algorithm for large-scale problems is also proposed and the results of a computational comparison between heuristic and optimal solutions are discussed.

AB - This paper deals with the single machine earliness and tardiness scheduling problem with a common due date and resource-dependent release dates. It is assumed that the cost of resource consumption of a job is a non-increasing linear function of the job release date, and this function is common for all jobs. The objective is to find a schedule and job release dates that minimize the total resource consumption, and earliness and tardiness penalties. It is shown that the problem is NP-hard in the ordinary sense even if the due date is unrestricted (the number of jobs that can be scheduled before the due date is unrestricted). An exact dynamic programming (DP) algorithm for small and medium size problems is developed. A heuristic algorithm for large-scale problems is also proposed and the results of a computational comparison between heuristic and optimal solutions are discussed.

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

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

U2 - 10.1016/S0377-2217(01)00292-2

DO - 10.1016/S0377-2217(01)00292-2

M3 - Article

AN - SCOPUS:0036794816

VL - 142

SP - 52

EP - 69

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -