摘要
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.
学科与关键词
关键词
no-wait flowshopbicriteriamakespantotal completion timeheuristic
- A bicriteria flowshop scheduling with a learning effectEren, Tamer*; Guner, ErtanAPPLIED MATHEMATICAL MODELLING, 2008, 32(9): 1719-1733.被引 51
- ALGORITHMS FOR BICRITERIA MINIMIZATION IN THE PERMUTATION FLOW SHOP SCHEDULING PROBLEMMokotoff, Ethel*Journal of Industrial and Management Optimization, 2011, 7(1): 253-282.被引 4
- Total completion time with makespan constraint in no-wait flowshops with setup timesAllahverdi, Ali*; Aydilek, HarunEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 238(3): 724-734.被引 32
