Parallel machine scheduling with earliness-tardiness penalties and space limits

Suk Jae Jeong, Kyung Sup Kim

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

In order to maximize an availability of machine and utilization of space, the parallel machines scheduling problem with space limit is frequently discussed in the industrial field. In this paper, we consider the parallel machine scheduling problem in which n jobs having different release times, due dates, and space limits are to be scheduled on m parallel machines. The objective function is to minimize the weighted sum of earliness and tardiness. To solve this problem, a heuristic is developed which is divided into three modules hierarchically: job selection, machine selection and job sequencing, and solution improvement. To illustrate its effectiveness, a proposed heuristic is compared with genetic algorithm (GA), hybrid genetic algorithm (HGA), and tabu search (TS), which are well-known meta-heuristics in a large number of randomly generated test problems based on the field situation. Also, we determine the job selection rule that is suitable to the problem situation considered in this paper and show the effectiveness of our heuristic method.

Original languageEnglish
Pages (from-to)793-802
Number of pages10
JournalInternational Journal of Advanced Manufacturing Technology
Volume37
Issue number7-8
DOIs
Publication statusPublished - 2008 Jun 1

Fingerprint

Genetic algorithms
Scheduling
Heuristic methods
Tabu search
Availability

All Science Journal Classification (ASJC) codes

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

Cite this

@article{846ff881d2124415b94429e6d16eb4f6,
title = "Parallel machine scheduling with earliness-tardiness penalties and space limits",
abstract = "In order to maximize an availability of machine and utilization of space, the parallel machines scheduling problem with space limit is frequently discussed in the industrial field. In this paper, we consider the parallel machine scheduling problem in which n jobs having different release times, due dates, and space limits are to be scheduled on m parallel machines. The objective function is to minimize the weighted sum of earliness and tardiness. To solve this problem, a heuristic is developed which is divided into three modules hierarchically: job selection, machine selection and job sequencing, and solution improvement. To illustrate its effectiveness, a proposed heuristic is compared with genetic algorithm (GA), hybrid genetic algorithm (HGA), and tabu search (TS), which are well-known meta-heuristics in a large number of randomly generated test problems based on the field situation. Also, we determine the job selection rule that is suitable to the problem situation considered in this paper and show the effectiveness of our heuristic method.",
author = "Jeong, {Suk Jae} and Kim, {Kyung Sup}",
year = "2008",
month = "6",
day = "1",
doi = "10.1007/s00170-007-1027-7",
language = "English",
volume = "37",
pages = "793--802",
journal = "International Journal of Advanced Manufacturing Technology",
issn = "0268-3768",
publisher = "Springer London",
number = "7-8",

}

Parallel machine scheduling with earliness-tardiness penalties and space limits. / Jeong, Suk Jae; Kim, Kyung Sup.

In: International Journal of Advanced Manufacturing Technology, Vol. 37, No. 7-8, 01.06.2008, p. 793-802.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Parallel machine scheduling with earliness-tardiness penalties and space limits

AU - Jeong, Suk Jae

AU - Kim, Kyung Sup

PY - 2008/6/1

Y1 - 2008/6/1

N2 - In order to maximize an availability of machine and utilization of space, the parallel machines scheduling problem with space limit is frequently discussed in the industrial field. In this paper, we consider the parallel machine scheduling problem in which n jobs having different release times, due dates, and space limits are to be scheduled on m parallel machines. The objective function is to minimize the weighted sum of earliness and tardiness. To solve this problem, a heuristic is developed which is divided into three modules hierarchically: job selection, machine selection and job sequencing, and solution improvement. To illustrate its effectiveness, a proposed heuristic is compared with genetic algorithm (GA), hybrid genetic algorithm (HGA), and tabu search (TS), which are well-known meta-heuristics in a large number of randomly generated test problems based on the field situation. Also, we determine the job selection rule that is suitable to the problem situation considered in this paper and show the effectiveness of our heuristic method.

AB - In order to maximize an availability of machine and utilization of space, the parallel machines scheduling problem with space limit is frequently discussed in the industrial field. In this paper, we consider the parallel machine scheduling problem in which n jobs having different release times, due dates, and space limits are to be scheduled on m parallel machines. The objective function is to minimize the weighted sum of earliness and tardiness. To solve this problem, a heuristic is developed which is divided into three modules hierarchically: job selection, machine selection and job sequencing, and solution improvement. To illustrate its effectiveness, a proposed heuristic is compared with genetic algorithm (GA), hybrid genetic algorithm (HGA), and tabu search (TS), which are well-known meta-heuristics in a large number of randomly generated test problems based on the field situation. Also, we determine the job selection rule that is suitable to the problem situation considered in this paper and show the effectiveness of our heuristic method.

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

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

U2 - 10.1007/s00170-007-1027-7

DO - 10.1007/s00170-007-1027-7

M3 - Article

AN - SCOPUS:42649132207

VL - 37

SP - 793

EP - 802

JO - International Journal of Advanced Manufacturing Technology

JF - International Journal of Advanced Manufacturing Technology

SN - 0268-3768

IS - 7-8

ER -