Scheduling jobs on parallel machines with sequence-dependent setup times

Young Hoon Lee, Michael Pinedo

Research output: Contribution to journalArticle

189 Citations (Scopus)

Abstract

Consider a number of jobs to be processed on a number of identical machines in parallel. A job has a processing time, a weight and a due date. If a job is followed by another job, a setup time independent of the machine is incurred. A three phase heuristic is presented for minimizing the sum of the weighted tardinesses. In the first phase, as a pre-processing procedure, factors or statistics which characterize an instance are computed. The second phase consists of constructing a sequence by a dispatching rule which is controlled through parameters determined by the factors. In the third phase, as a post-processing procedure, a simulated annealing method is applied starting from a seed solution which is the result of the second phase. In the dispatching rule of the second phase there are two parameters of which the values are dependent on the particular problem instance at hand. Through extensive experiments rules are developed for determining the values of the two parameters which make the priority rule work effectively. The performance of the simulated annealing procedure in the third phase is evaluated for various values of the factors.

Original languageEnglish
Pages (from-to)464-474
Number of pages11
JournalEuropean Journal of Operational Research
Volume100
Issue number3
DOIs
Publication statusPublished - 1997 Aug 1

Fingerprint

Sequence-dependent Setup Times
Job Scheduling
Parallel Machines
Scheduling
Simulated annealing
Processing
Dispatching Rules
Seed
Simulated Annealing
Two Parameters
Statistics
Priority Rules
Setup Times
Due Dates
Sequence-dependent setup times
Parallel machines
Post-processing
Preprocessing
Experiments
Heuristics

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this

@article{ace7852f736a458fb0289bf708e5a002,
title = "Scheduling jobs on parallel machines with sequence-dependent setup times",
abstract = "Consider a number of jobs to be processed on a number of identical machines in parallel. A job has a processing time, a weight and a due date. If a job is followed by another job, a setup time independent of the machine is incurred. A three phase heuristic is presented for minimizing the sum of the weighted tardinesses. In the first phase, as a pre-processing procedure, factors or statistics which characterize an instance are computed. The second phase consists of constructing a sequence by a dispatching rule which is controlled through parameters determined by the factors. In the third phase, as a post-processing procedure, a simulated annealing method is applied starting from a seed solution which is the result of the second phase. In the dispatching rule of the second phase there are two parameters of which the values are dependent on the particular problem instance at hand. Through extensive experiments rules are developed for determining the values of the two parameters which make the priority rule work effectively. The performance of the simulated annealing procedure in the third phase is evaluated for various values of the factors.",
author = "Lee, {Young Hoon} and Michael Pinedo",
year = "1997",
month = "8",
day = "1",
doi = "10.1016/S0377-2217(95)00376-2",
language = "English",
volume = "100",
pages = "464--474",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "3",

}

Scheduling jobs on parallel machines with sequence-dependent setup times. / Lee, Young Hoon; Pinedo, Michael.

In: European Journal of Operational Research, Vol. 100, No. 3, 01.08.1997, p. 464-474.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Scheduling jobs on parallel machines with sequence-dependent setup times

AU - Lee, Young Hoon

AU - Pinedo, Michael

PY - 1997/8/1

Y1 - 1997/8/1

N2 - Consider a number of jobs to be processed on a number of identical machines in parallel. A job has a processing time, a weight and a due date. If a job is followed by another job, a setup time independent of the machine is incurred. A three phase heuristic is presented for minimizing the sum of the weighted tardinesses. In the first phase, as a pre-processing procedure, factors or statistics which characterize an instance are computed. The second phase consists of constructing a sequence by a dispatching rule which is controlled through parameters determined by the factors. In the third phase, as a post-processing procedure, a simulated annealing method is applied starting from a seed solution which is the result of the second phase. In the dispatching rule of the second phase there are two parameters of which the values are dependent on the particular problem instance at hand. Through extensive experiments rules are developed for determining the values of the two parameters which make the priority rule work effectively. The performance of the simulated annealing procedure in the third phase is evaluated for various values of the factors.

AB - Consider a number of jobs to be processed on a number of identical machines in parallel. A job has a processing time, a weight and a due date. If a job is followed by another job, a setup time independent of the machine is incurred. A three phase heuristic is presented for minimizing the sum of the weighted tardinesses. In the first phase, as a pre-processing procedure, factors or statistics which characterize an instance are computed. The second phase consists of constructing a sequence by a dispatching rule which is controlled through parameters determined by the factors. In the third phase, as a post-processing procedure, a simulated annealing method is applied starting from a seed solution which is the result of the second phase. In the dispatching rule of the second phase there are two parameters of which the values are dependent on the particular problem instance at hand. Through extensive experiments rules are developed for determining the values of the two parameters which make the priority rule work effectively. The performance of the simulated annealing procedure in the third phase is evaluated for various values of the factors.

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

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

U2 - 10.1016/S0377-2217(95)00376-2

DO - 10.1016/S0377-2217(95)00376-2

M3 - Article

AN - SCOPUS:0000482108

VL - 100

SP - 464

EP - 474

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -