Journal
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Volume 53, Issue 9, Pages 1004-1015Publisher
PALGRAVE PUBLISHERS LTD
DOI: 10.1057/palgrave.jors.2601403
Keywords
no-wait flowshop; bicriteria; makespan; total completion time; heuristic
Ask authors/readers for more resources
We consider the m-machine no-wait flowshop scheduling problem with the objective of minimizing a weighted sum of makespan and total completion time. For the two-machine problem, we develop a dominance relation and embed it within a proposed branch-and-bound algorithm. For the m-machine problem, we propose a heuristic. Computational experiments show that the proposed heuristic outperforms the best existing multi-criteria heuristics and the best single criterion heuristics for makespan and total completion time. The efficiency of the dominance relation and branch-and-bound algorithm is also investigated and shown to be effective.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available