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.
Hsu, Chou-Jung; Kuo, Wen-Hung; Yang, Dar-Li; and Chern, Maw-Sheng
"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:
4, Article 3.
Available at: https://jmstt.ntou.edu.tw/journal/vol14/iss4/3