MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server

Mi Yi Kim, Young Hoon Lee

Research output: Contribution to journalArticle

31 Citations (Scopus)

Abstract

This paper considers the identical parallel machines scheduling problem (PMSP) with a single server in charge of job setups. A job can be processed with a precedent setup by a server on one of the machines. The setup can be processed at only one machine at any time. In this paper, the problem P, S1|s j|C max with a general job set is formulated using mixed integer programming in two ways. The first one is developed by taking into account the characteristics of the single server problem, and the second one is developed by adding the concept of the server waiting time suggested by Abdekhodaee and Wirth (2002) [3]. Abdekhodaee and Wirth (2002) [3] define the equation of the server waiting time applied to only the special case with two machines and a regular job set. The general model for several machines is studied in this paper by developing the properties on the server waiting time. The hybrid heuristic algorithm is developed for the practical use, which can yield a near-optimal schedule in a reasonable computational time. The performance of algorithm is evaluated by comparing with the results of MIP models and heuristics appearing in the literature.

Original languageEnglish
Pages (from-to)2457-2468
Number of pages12
JournalComputers and Operations Research
Volume39
Issue number11
DOIs
Publication statusPublished - 2012 Nov 1

Fingerprint

Parallel Machine Scheduling
Single Server
Hybrid Algorithm
Scheduling Problem
Servers
Server
Scheduling
Waiting Time
Identical Parallel Machines
Mixed Integer Programming
Model
Heuristic algorithm
Schedule
Charge
Integer programming
Heuristics
Heuristic algorithms
Makespan
Parallel machine scheduling
Hybrid algorithm

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Management Science and Operations Research
  • Modelling and Simulation

Cite this

@article{56bb722077a846e5937b7ce531a6d8cd,
title = "MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server",
abstract = "This paper considers the identical parallel machines scheduling problem (PMSP) with a single server in charge of job setups. A job can be processed with a precedent setup by a server on one of the machines. The setup can be processed at only one machine at any time. In this paper, the problem P, S1|s j|C max with a general job set is formulated using mixed integer programming in two ways. The first one is developed by taking into account the characteristics of the single server problem, and the second one is developed by adding the concept of the server waiting time suggested by Abdekhodaee and Wirth (2002) [3]. Abdekhodaee and Wirth (2002) [3] define the equation of the server waiting time applied to only the special case with two machines and a regular job set. The general model for several machines is studied in this paper by developing the properties on the server waiting time. The hybrid heuristic algorithm is developed for the practical use, which can yield a near-optimal schedule in a reasonable computational time. The performance of algorithm is evaluated by comparing with the results of MIP models and heuristics appearing in the literature.",
author = "Kim, {Mi Yi} and Lee, {Young Hoon}",
year = "2012",
month = "11",
day = "1",
doi = "10.1016/j.cor.2011.12.011",
language = "English",
volume = "39",
pages = "2457--2468",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "11",

}

MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server. / Kim, Mi Yi; Lee, Young Hoon.

In: Computers and Operations Research, Vol. 39, No. 11, 01.11.2012, p. 2457-2468.

Research output: Contribution to journalArticle

TY - JOUR

T1 - MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server

AU - Kim, Mi Yi

AU - Lee, Young Hoon

PY - 2012/11/1

Y1 - 2012/11/1

N2 - This paper considers the identical parallel machines scheduling problem (PMSP) with a single server in charge of job setups. A job can be processed with a precedent setup by a server on one of the machines. The setup can be processed at only one machine at any time. In this paper, the problem P, S1|s j|C max with a general job set is formulated using mixed integer programming in two ways. The first one is developed by taking into account the characteristics of the single server problem, and the second one is developed by adding the concept of the server waiting time suggested by Abdekhodaee and Wirth (2002) [3]. Abdekhodaee and Wirth (2002) [3] define the equation of the server waiting time applied to only the special case with two machines and a regular job set. The general model for several machines is studied in this paper by developing the properties on the server waiting time. The hybrid heuristic algorithm is developed for the practical use, which can yield a near-optimal schedule in a reasonable computational time. The performance of algorithm is evaluated by comparing with the results of MIP models and heuristics appearing in the literature.

AB - This paper considers the identical parallel machines scheduling problem (PMSP) with a single server in charge of job setups. A job can be processed with a precedent setup by a server on one of the machines. The setup can be processed at only one machine at any time. In this paper, the problem P, S1|s j|C max with a general job set is formulated using mixed integer programming in two ways. The first one is developed by taking into account the characteristics of the single server problem, and the second one is developed by adding the concept of the server waiting time suggested by Abdekhodaee and Wirth (2002) [3]. Abdekhodaee and Wirth (2002) [3] define the equation of the server waiting time applied to only the special case with two machines and a regular job set. The general model for several machines is studied in this paper by developing the properties on the server waiting time. The hybrid heuristic algorithm is developed for the practical use, which can yield a near-optimal schedule in a reasonable computational time. The performance of algorithm is evaluated by comparing with the results of MIP models and heuristics appearing in the literature.

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

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

U2 - 10.1016/j.cor.2011.12.011

DO - 10.1016/j.cor.2011.12.011

M3 - Article

VL - 39

SP - 2457

EP - 2468

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 11

ER -