Due-date scheduling on parallel machines with job splitting and sequence-dependent major/minor setup times

Taeho Park, Taehyung Lee, Chang Ouk Kim

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

This paper addresses job scheduling problems with parallel machines. To satisfy customers better in a manufacturing company, meeting due dates has been an important performance metric. Besides the numerous other factors affecting due date satisfaction, the splitting of a job through parallel machines can contribute to the reduction of production lead time, resulting in less job tardiness against their due dates. Thus, this paper presents heuristic algorithms for minimizing total tardiness of jobs to meet their due dates in a manufacturing shop with identically functioning machines. The algorithms take into account job splitting and sequence-dependent major/minor setup times. The performance of the proposed heuristics is compared with that of past three algorithms in the literature.

Original languageEnglish
Pages (from-to)325-333
Number of pages9
JournalInternational Journal of Advanced Manufacturing Technology
Volume59
Issue number1-4
DOIs
Publication statusPublished - 2012 Mar 1

Fingerprint

Scheduling
Heuristic algorithms
Industry

All Science Journal Classification (ASJC) codes

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

Cite this

@article{70d96b31a0aa4347aa9166c9e6a64bee,
title = "Due-date scheduling on parallel machines with job splitting and sequence-dependent major/minor setup times",
abstract = "This paper addresses job scheduling problems with parallel machines. To satisfy customers better in a manufacturing company, meeting due dates has been an important performance metric. Besides the numerous other factors affecting due date satisfaction, the splitting of a job through parallel machines can contribute to the reduction of production lead time, resulting in less job tardiness against their due dates. Thus, this paper presents heuristic algorithms for minimizing total tardiness of jobs to meet their due dates in a manufacturing shop with identically functioning machines. The algorithms take into account job splitting and sequence-dependent major/minor setup times. The performance of the proposed heuristics is compared with that of past three algorithms in the literature.",
author = "Taeho Park and Taehyung Lee and Kim, {Chang Ouk}",
year = "2012",
month = "3",
day = "1",
doi = "10.1007/s00170-011-3489-x",
language = "English",
volume = "59",
pages = "325--333",
journal = "International Journal of Advanced Manufacturing Technology",
issn = "0268-3768",
publisher = "Springer London",
number = "1-4",

}

Due-date scheduling on parallel machines with job splitting and sequence-dependent major/minor setup times. / Park, Taeho; Lee, Taehyung; Kim, Chang Ouk.

In: International Journal of Advanced Manufacturing Technology, Vol. 59, No. 1-4, 01.03.2012, p. 325-333.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Due-date scheduling on parallel machines with job splitting and sequence-dependent major/minor setup times

AU - Park, Taeho

AU - Lee, Taehyung

AU - Kim, Chang Ouk

PY - 2012/3/1

Y1 - 2012/3/1

N2 - This paper addresses job scheduling problems with parallel machines. To satisfy customers better in a manufacturing company, meeting due dates has been an important performance metric. Besides the numerous other factors affecting due date satisfaction, the splitting of a job through parallel machines can contribute to the reduction of production lead time, resulting in less job tardiness against their due dates. Thus, this paper presents heuristic algorithms for minimizing total tardiness of jobs to meet their due dates in a manufacturing shop with identically functioning machines. The algorithms take into account job splitting and sequence-dependent major/minor setup times. The performance of the proposed heuristics is compared with that of past three algorithms in the literature.

AB - This paper addresses job scheduling problems with parallel machines. To satisfy customers better in a manufacturing company, meeting due dates has been an important performance metric. Besides the numerous other factors affecting due date satisfaction, the splitting of a job through parallel machines can contribute to the reduction of production lead time, resulting in less job tardiness against their due dates. Thus, this paper presents heuristic algorithms for minimizing total tardiness of jobs to meet their due dates in a manufacturing shop with identically functioning machines. The algorithms take into account job splitting and sequence-dependent major/minor setup times. The performance of the proposed heuristics is compared with that of past three algorithms in the literature.

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

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

U2 - 10.1007/s00170-011-3489-x

DO - 10.1007/s00170-011-3489-x

M3 - Article

AN - SCOPUS:84857794477

VL - 59

SP - 325

EP - 333

JO - International Journal of Advanced Manufacturing Technology

JF - International Journal of Advanced Manufacturing Technology

SN - 0268-3768

IS - 1-4

ER -