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

Authors:
Mi-Yi Kim;Young Hoon Lee
Affiliations:
Department of Information and Industrial Engineering, Yonsei University, 134 Shinchon-dong, Seodaemoon-Gu, Seoul, Republic of Korea;Department of Information and Industrial Engineering, Yonsei University, 134 Shinchon-dong, Seodaemoon-Gu, Seoul, Republic of Korea
Venue:
Computers and Operations Research
Year:
2012

Citing 12
Cited 1

Scheduling two parallel semiautomatic machines to minimize machine interference

Computers and Operations Research
Parallel machine scheduling with a common server

Discrete Applied Mathematics
Scheduling parallel machines with a single server: some solvable cases and heuristics

Computers and Operations Research
Scheduling problems for parallel dedicated machines under multiple resource constraints

Discrete Applied Mathematics - International symposium on combinatorial optimisation
Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot

Operations Research
Equal processing and equal setup time cases of scheduling parallel machines with a single server

Computers and Operations Research
Sequencing and Scheduling in Robotic Cells: Recent Developments

Journal of Scheduling
Scheduling two parallel machines with a single server: the general case

Computers and Operations Research
Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server

Computers and Industrial Engineering
Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints

Computers and Operations Research
Scheduling with multiple servers

Automation and Remote Control
Parallel machine scheduling problems with a single server

Mathematical and Computer Modelling: An International Journal

Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

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"m"a"x 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.