A heuristic to minimize the total weighted tardiness with sequence-dependent setups

Young Hoon Lee, Kumar Bhaskaran, Michael Pinedo

Research output: Contribution to journalArticle

196 Citations (Scopus)

Abstract

We propose a three-phase heuristic for the problem of minimizing the total weighted tardiness on a single machine in the presence of sequence-dependent setup times. In the first phase a number of parameters characterizing the problem instance at hand are calculated. In the second phase we develop a schedule by using a new priority rule whose parameters are calculated based on the results of the first phase. Computational experiments show that this rule significantly outperforms the only other rule so far developed in the literature. The third phase consists of a local improvement procedure to improve the schedule obtained in the second phase. The procedure we suggest has been successfully implemented in an industrial scheduling system.

Original languageEnglish
Pages (from-to)45-52
Number of pages8
JournalIIE Transactions (Institute of Industrial Engineers)
Volume29
Issue number1
DOIs
Publication statusPublished - 1997 Jan

Fingerprint

Scheduling
Experiments

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

@article{181a7c40317b4fb5af15628caf0491d4,
title = "A heuristic to minimize the total weighted tardiness with sequence-dependent setups",
abstract = "We propose a three-phase heuristic for the problem of minimizing the total weighted tardiness on a single machine in the presence of sequence-dependent setup times. In the first phase a number of parameters characterizing the problem instance at hand are calculated. In the second phase we develop a schedule by using a new priority rule whose parameters are calculated based on the results of the first phase. Computational experiments show that this rule significantly outperforms the only other rule so far developed in the literature. The third phase consists of a local improvement procedure to improve the schedule obtained in the second phase. The procedure we suggest has been successfully implemented in an industrial scheduling system.",
author = "Lee, {Young Hoon} and Kumar Bhaskaran and Michael Pinedo",
year = "1997",
month = "1",
doi = "10.1080/07408179708966311",
language = "English",
volume = "29",
pages = "45--52",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "1",

}

A heuristic to minimize the total weighted tardiness with sequence-dependent setups. / Lee, Young Hoon; Bhaskaran, Kumar; Pinedo, Michael.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 29, No. 1, 01.1997, p. 45-52.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A heuristic to minimize the total weighted tardiness with sequence-dependent setups

AU - Lee, Young Hoon

AU - Bhaskaran, Kumar

AU - Pinedo, Michael

PY - 1997/1

Y1 - 1997/1

N2 - We propose a three-phase heuristic for the problem of minimizing the total weighted tardiness on a single machine in the presence of sequence-dependent setup times. In the first phase a number of parameters characterizing the problem instance at hand are calculated. In the second phase we develop a schedule by using a new priority rule whose parameters are calculated based on the results of the first phase. Computational experiments show that this rule significantly outperforms the only other rule so far developed in the literature. The third phase consists of a local improvement procedure to improve the schedule obtained in the second phase. The procedure we suggest has been successfully implemented in an industrial scheduling system.

AB - We propose a three-phase heuristic for the problem of minimizing the total weighted tardiness on a single machine in the presence of sequence-dependent setup times. In the first phase a number of parameters characterizing the problem instance at hand are calculated. In the second phase we develop a schedule by using a new priority rule whose parameters are calculated based on the results of the first phase. Computational experiments show that this rule significantly outperforms the only other rule so far developed in the literature. The third phase consists of a local improvement procedure to improve the schedule obtained in the second phase. The procedure we suggest has been successfully implemented in an industrial scheduling system.

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

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

U2 - 10.1080/07408179708966311

DO - 10.1080/07408179708966311

M3 - Article

AN - SCOPUS:0030735290

VL - 29

SP - 45

EP - 52

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 1

ER -