MINIMIZING THE MAKESPAN IN A TWO-STAGE FLOWSHOP SCHEDULING PROBLEM WITH A FUNCTION CONSTRAINT ON ALTERNATIVE MACHINES

Authors

Chou-Jung Hsu, Lecturer, Department of Industrial Engineering and Management, Nan Kai Institute of Technology, Nantou, Taiwan 542, R.O.C.Follow
Wen-Hung Kuo, Assistant Professor, Department of Information Management, National Formosa University Yun-Lin, Taiwan 632, R.O.C.
Dar-Li Yang, Professor, Department of Information Management, National Formosa University Yun-Lin, Taiwan 632, R.O.C.
Maw-Sheng Chern, Professor, Department of Industrial Engineering and Engineering Management, National Tsing-Hua University, Hsin-Chu, Taiwan 300, R.O.C.

Abstract

In this paper, we consider a two-stage flowshop scheduling problem with a function constraint on alternative machines. The objective is to minimize the makespan. We show that the proposed problem is NP-hard and provide some heuristic algorithms and computational experiments. In addition, from the experimental results, the modification of Johnson’s rule combined with the First-Fit rule is the best heuristic algorithm of the proposed heuristic algorithms.

Recommended Citation

Hsu, Chou-Jung; Kuo, Wen-Hung; Yang, Dar-Li; and Chern, Maw-Sheng (2006) "MINIMIZING THE MAKESPAN IN A TWO-STAGE FLOWSHOP SCHEDULING PROBLEM WITH A FUNCTION CONSTRAINT ON ALTERNATIVE MACHINES," Journal of Marine Science and Technology: Vol. 14: Iss. 4, Article 3.
DOI: 10.51400/2709-6998.2082
Available at: https://jmstt.ntou.edu.tw/journal/vol14/iss4/3