Uniform Parallel Machine Scheduling with Dedicated Machines, Job Splitting and Setup Resources

Hyun-Jung Kim,Jun-Ho Lee

doi:10.1109/coase.2018.8560409

Hyun-Jung Kim, Jun-Ho Lee

Open Access

https://doi.org/10.1109/coase.2018.8560409

Copy DOI

Publication Date: Aug 1, 2018
Citations: 8	License type: cc-by

Affiliation: Sungkyunkwan University, Konkuk University

Abstract

This paper examines a uniform parallel machine scheduling problem in which jobs can be split arbitrary into multiple sections and such job sections can be processed on a set of dedicated machines simultaneously. Once a job type is changed, a setup performed by an operator is required. The setup time is sequence-independent, and the number of setup operators is limited. Machines conduct the same operation but have different speeds. The objective is to minimize the maximum completion time. This problem is motivated from real-life applications that manufacture automotive pistons in Korea. We propose efficient heuristic algorithms for this problem and show experimentally that the performance of the algorithms is good enough to be used in practice.

Highlights

In recent manufacturing industries, increasing productivity and minimizing production costs are essential for a sustainable business
We consider a uniform parallel machine scheduling problem with dedicated machines, job splitting properties, and limited setup resources, which can be observed in practice
Since a uniform parallel machine scheduling problem with dedicated machines, job splitting, and setup resources is considered, relevant literature can be classified into three groups: studies considering parallel machines, job splitting, and resources

Summary

Introduction

In recent manufacturing industries, increasing productivity and minimizing production costs are essential for a sustainable business. We consider a uniform parallel machine scheduling problem with dedicated machines, job splitting properties, and limited setup resources, which can be observed in practice. FFUs or EFUs can be assembled in one of dedicated machines, and setups are performed when job types are changed, which are sequence-independent and require a setup operator. The problem considered in this paper has many real applications and is constrained by various scheduling requirements such as parallel machines with different speeds, dedicated machines, and limited setup operators. This paper is intended to contribute to this end by presenting a mathematical optimization model and developing efficient heuristic algorithms

Literature Review

Heuristic Algorithms

Experimental Results

Conclusions