A two-machine flowshop scheduling problem with a separated maintenance constraint

Authors:
Dar-Li Yang;Chou-Jung Hsu;Wen-Hung Kuo
Affiliations:
Department of Information Management, National Formosa University, Yun-Lin, Taiwan 632, ROC;Department of Industrial Engineering and Management, Nan Kai College, Nan-Tou, Taiwan 542, ROC;Department of Industrial Engineering and Technology Management, Da-Yeh University, Chang-Hwa, Taiwan 515, ROC
Venue:
Computers and Operations Research
Year:
2008

Citing 2
Cited 6

Scheduling in stochastic flowshops with independent setup, processing and removal times

Computers and Operations Research
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

Operations Research Letters

Scheduling a maintenance activity to minimize total weighted completion-time

Computers & Mathematics with Applications
Scheduling a maintenance activity and due-window assignment on a single machine

Computers and Operations Research
An effective heuristic for flexible job-shop scheduling problem with maintenance activities

Computers and Industrial Engineering
Minimizing total completion time on a single machine with a flexible maintenance activity

Computers and Operations Research
A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown

Expert Systems with Applications: An International Journal
Incorporating periodic preventive maintenance into flexible flowshop scheduling problems

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers a two-machine flowshop scheduling problem with a separated maintenance constraint. This means that the machine may not always be available during the scheduling period. It needs a constant time to maintain the machine after completing a fixed number of jobs at most. The objective is to find the optimal job combinations and the optimal job schedule such that the makespan is minimized. The proposed problem has some practical applications, for example, in electroplating process, the electrolytic cell needs to be cleaned and made up a deficiency of medicine. In this paper, we propose a heuristic algorithm to solve this problem. Some polynomially solvable cases and computational experiments are also provided.