A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times

H. J. Shin, C. O. Kim, S. S. Kim

Research output: Contribution to journalArticle

28 Citations (Scopus)

Abstract

In this paper, we present a tabu search algorithm that schedules N jobs to a single machine in order to minimise the maximum lateness of the jobs. The release times, due dates, and sequence-dependent set-up times of the jobs are assumed to exist. We modified the original tabu search method to be suitable for the scheduling problem. The proposed tabu search algorithm is composed of two parts: a MATCS (modified apparent tardiness cost with set-ups) rule for finding an efficient initial solution, and the tabu search method to seek a near optimal solution from the initial solution. The experimental results show that the tabu search algorithm obtains much better solutions more quickly than the RHP (rolling horizon procedure) heuristic suggested by Ovacik and Uzsoy.

Original languageEnglish
Pages (from-to)859-866
Number of pages8
JournalInternational Journal of Advanced Manufacturing Technology
Volume19
Issue number11
DOIs
Publication statusPublished - 2002 Jul 27

Fingerprint

Tabu search
Scheduling
Costs

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Software
  • Mechanical Engineering
  • Computer Science Applications
  • Industrial and Manufacturing Engineering

Cite this

@article{19a42d68828346e08442c2a8949c988e,
title = "A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times",
abstract = "In this paper, we present a tabu search algorithm that schedules N jobs to a single machine in order to minimise the maximum lateness of the jobs. The release times, due dates, and sequence-dependent set-up times of the jobs are assumed to exist. We modified the original tabu search method to be suitable for the scheduling problem. The proposed tabu search algorithm is composed of two parts: a MATCS (modified apparent tardiness cost with set-ups) rule for finding an efficient initial solution, and the tabu search method to seek a near optimal solution from the initial solution. The experimental results show that the tabu search algorithm obtains much better solutions more quickly than the RHP (rolling horizon procedure) heuristic suggested by Ovacik and Uzsoy.",
author = "Shin, {H. J.} and Kim, {C. O.} and Kim, {S. S.}",
year = "2002",
month = "7",
day = "27",
doi = "10.1007/s001700200097",
language = "English",
volume = "19",
pages = "859--866",
journal = "International Journal of Advanced Manufacturing Technology",
issn = "0268-3768",
publisher = "Springer London",
number = "11",

}

TY - JOUR

T1 - A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times

AU - Shin, H. J.

AU - Kim, C. O.

AU - Kim, S. S.

PY - 2002/7/27

Y1 - 2002/7/27

N2 - In this paper, we present a tabu search algorithm that schedules N jobs to a single machine in order to minimise the maximum lateness of the jobs. The release times, due dates, and sequence-dependent set-up times of the jobs are assumed to exist. We modified the original tabu search method to be suitable for the scheduling problem. The proposed tabu search algorithm is composed of two parts: a MATCS (modified apparent tardiness cost with set-ups) rule for finding an efficient initial solution, and the tabu search method to seek a near optimal solution from the initial solution. The experimental results show that the tabu search algorithm obtains much better solutions more quickly than the RHP (rolling horizon procedure) heuristic suggested by Ovacik and Uzsoy.

AB - In this paper, we present a tabu search algorithm that schedules N jobs to a single machine in order to minimise the maximum lateness of the jobs. The release times, due dates, and sequence-dependent set-up times of the jobs are assumed to exist. We modified the original tabu search method to be suitable for the scheduling problem. The proposed tabu search algorithm is composed of two parts: a MATCS (modified apparent tardiness cost with set-ups) rule for finding an efficient initial solution, and the tabu search method to seek a near optimal solution from the initial solution. The experimental results show that the tabu search algorithm obtains much better solutions more quickly than the RHP (rolling horizon procedure) heuristic suggested by Ovacik and Uzsoy.

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

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

U2 - 10.1007/s001700200097

DO - 10.1007/s001700200097

M3 - Article

AN - SCOPUS:0036062266

VL - 19

SP - 859

EP - 866

JO - International Journal of Advanced Manufacturing Technology

JF - International Journal of Advanced Manufacturing Technology

SN - 0268-3768

IS - 11

ER -