Premium
A branch‐and‐bound algorithm for the three‐machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime
Author(s) -
Yeh WeiChang,
Allahverdi Ali
Publication year - 2004
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.2004.00461.x
Subject(s) - job shop scheduling , upper and lower bounds , branch and bound , scheduling (production processes) , mathematical optimization , computer science , dominance (genetics) , mathematics , heuristic , algorithm , chemistry , mathematical analysis , biochemistry , schedule , gene , operating system
This paper addresses the three‐machine flowshop scheduling problem with a bicriteria of minimizing a weighted sum of makespan and total flowtime. Three lower bounds, an upper bound, and several dominance relations are developed. The upper bound is developed using a two‐phase hybrid heuristic method. A branch‐and‐bound algorithm, incorporating the developed bounds and dominance relations, is presented. An extensive computational analysis on randomly generated problems is conducted. The analysis indicates that the proposed bounds, dominance relations, and branch‐and‐bound algorithm are efficient.