Scheduling jobs on parallel machines with sequence-dependent family set-up times

D. H. Eom, H. J. Shin, I. H. Kwun, Jae Kyung Shim, S. S. Kim

Research output: Contribution to journalArticle

39 Citations (Scopus)

Abstract

This paper proposes an efficient heuristic to minimise the total weighted tardiness of a set of tasks with known processing times, due dates, weights and family types for parallel machines. A three-phase heuristic is presented to minimise total weighted tardiness. In the first phase, jobs are listed by the earliest due date and then divided into small job-sets according to a decision parameter. In the second phase, jobs are grouped by the due date within applicable families using apparent tardiness cost with set-up (ATCS), and the sequence of jobs within families is improved through the use of the tabu search method. In the third phase, jobs are allocated to machines using a threshold value and a look-ahead parameter. The comprehensive simulation results show that the proposed heuristic performs better than the ATCS and rolling horizon procedure at a significantly reduced total weighted tardiness.

Original languageEnglish
Pages (from-to)926-932
Number of pages7
JournalInternational Journal of Advanced Manufacturing Technology
Volume19
Issue number12
DOIs
Publication statusPublished - 2002 Jul 27

Fingerprint

Scheduling
Tabu search
Costs
Processing

Keywords

  • Heuristics
  • Parallel machines
  • Scheduling
  • Sequence-dependent family set-up times
  • Total weighted tardiness

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

Scheduling jobs on parallel machines with sequence-dependent family set-up times. / Eom, D. H.; Shin, H. J.; Kwun, I. H.; Shim, Jae Kyung; Kim, S. S.

In: International Journal of Advanced Manufacturing Technology, Vol. 19, No. 12, 27.07.2002, p. 926-932.

Research output: Contribution to journalArticle

@article{c7bbc70b16c94881b51dd65467db2740,
title = "Scheduling jobs on parallel machines with sequence-dependent family set-up times",
abstract = "This paper proposes an efficient heuristic to minimise the total weighted tardiness of a set of tasks with known processing times, due dates, weights and family types for parallel machines. A three-phase heuristic is presented to minimise total weighted tardiness. In the first phase, jobs are listed by the earliest due date and then divided into small job-sets according to a decision parameter. In the second phase, jobs are grouped by the due date within applicable families using apparent tardiness cost with set-up (ATCS), and the sequence of jobs within families is improved through the use of the tabu search method. In the third phase, jobs are allocated to machines using a threshold value and a look-ahead parameter. The comprehensive simulation results show that the proposed heuristic performs better than the ATCS and rolling horizon procedure at a significantly reduced total weighted tardiness.",
keywords = "Heuristics, Parallel machines, Scheduling, Sequence-dependent family set-up times, Total weighted tardiness",
author = "Eom, {D. H.} and Shin, {H. J.} and Kwun, {I. H.} and Shim, {Jae Kyung} and Kim, {S. S.}",
year = "2002",
month = "7",
day = "27",
doi = "10.1007/s001700200105",
language = "English",
volume = "19",
pages = "926--932",
journal = "International Journal of Advanced Manufacturing Technology",
issn = "0268-3768",
publisher = "Springer London",
number = "12",

}

TY - JOUR

T1 - Scheduling jobs on parallel machines with sequence-dependent family set-up times

AU - Eom, D. H.

AU - Shin, H. J.

AU - Kwun, I. H.

AU - Shim, Jae Kyung

AU - Kim, S. S.

PY - 2002/7/27

Y1 - 2002/7/27

N2 - This paper proposes an efficient heuristic to minimise the total weighted tardiness of a set of tasks with known processing times, due dates, weights and family types for parallel machines. A three-phase heuristic is presented to minimise total weighted tardiness. In the first phase, jobs are listed by the earliest due date and then divided into small job-sets according to a decision parameter. In the second phase, jobs are grouped by the due date within applicable families using apparent tardiness cost with set-up (ATCS), and the sequence of jobs within families is improved through the use of the tabu search method. In the third phase, jobs are allocated to machines using a threshold value and a look-ahead parameter. The comprehensive simulation results show that the proposed heuristic performs better than the ATCS and rolling horizon procedure at a significantly reduced total weighted tardiness.

AB - This paper proposes an efficient heuristic to minimise the total weighted tardiness of a set of tasks with known processing times, due dates, weights and family types for parallel machines. A three-phase heuristic is presented to minimise total weighted tardiness. In the first phase, jobs are listed by the earliest due date and then divided into small job-sets according to a decision parameter. In the second phase, jobs are grouped by the due date within applicable families using apparent tardiness cost with set-up (ATCS), and the sequence of jobs within families is improved through the use of the tabu search method. In the third phase, jobs are allocated to machines using a threshold value and a look-ahead parameter. The comprehensive simulation results show that the proposed heuristic performs better than the ATCS and rolling horizon procedure at a significantly reduced total weighted tardiness.

KW - Heuristics

KW - Parallel machines

KW - Scheduling

KW - Sequence-dependent family set-up times

KW - Total weighted tardiness

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

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

U2 - 10.1007/s001700200105

DO - 10.1007/s001700200105

M3 - Article

AN - SCOPUS:0036067263

VL - 19

SP - 926

EP - 932

JO - International Journal of Advanced Manufacturing Technology

JF - International Journal of Advanced Manufacturing Technology

SN - 0268-3768

IS - 12

ER -