New lower bound for the hybrid flowshop scheduling problem

被引：6
|
作者：
Vignier, A
Commandeur, P
Proust, C
机构：
来源：
ETFA '97 - 1997 IEEE 6TH INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION PROCEEDINGS | 1997年
关键词：
D O I：
10.1109/ETFA.1997.616312
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The problem addressed in this paper deals with the Hybrid Flowshop Scheduling Problem (HFSP). We propose a new lower bound for the maximum completion time (makespan) criterion and a branch and bound procedure to solve a k-stage HFSP in which the maximum completion time is the criterion to be optimized. This problem has been already treated but we prove that our bound is better than those derived for the same criterion. To illustrate this dominance property, we propose experimental results in order to show the efficiency of this bound.
引用
收藏
页码：446 / 451
页数：6
相关论文
共 50 条
  • [1] On the hybrid flowshop scheduling problem
    Haouari, Mohamed
    Hidri, Lotfi
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 113 (01) : 495 - 497
  • [2] Hybrid branch and bound method with genetic algorithm for flexible flowshop scheduling problem
    Morita, H
    Shio, N
    [J]. JSME INTERNATIONAL JOURNAL SERIES C-MECHANICAL SYSTEMS MACHINE ELEMENTS AND MANUFACTURING, 2005, 48 (01) : 46 - 52
  • [3] Branch and bound lower bounds for the hybrid flowshop
    Moursli, O
    [J]. INTELLIGENT MANUFACTURING SYSTEMS 1997 (IMS'97), 1997, : 31 - 36
  • [4] Slope index for hybrid flowshop scheduling problem
    Li, Xiao-Feng
    Shao, Hui-He
    Ren, De-Xiang
    [J]. Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2002, 36 (08): : 1155 - 1157
  • [5] New Efficient Lower Bound for the Hybrid Flow Shop Scheduling Problem With Multiprocessor Tasks
    Hidri, Lotfi
    Gharbi, Anis
    [J]. IEEE ACCESS, 2017, 5 : 6121 - 6133
  • [6] Metaheuristic algorithms for the hybrid flowshop scheduling problem
    Oztop, Hande
    Tasgetiren, M. Fatih
    Eliiyi, Deniz Tursel
    Pan, Quan-Ke
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2019, 111 : 177 - 196
  • [7] A new branch-and-bound approach for the n/2/flowshop/αF+βCmax flowshop scheduling problem
    Yeh, WC
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (13) : 1293 - 1310
  • [8] Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem
    Jin, ZH
    Yang, Z
    Ito, T
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 100 (02) : 322 - 334
  • [9] Note on the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks
    Hidri, Lotfi
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2016, 182 : 531 - 534
  • [10] Solving Blocking Flowshop Scheduling Problem with Branch and Bound Algorithm
    Toumi, Said
    Jarboui, Bassem
    Eddaly, Mansour
    Rebai, Abdelwaheb
    [J]. 2013 INTERNATIONAL CONFERENCE ON ADVANCED LOGISTICS AND TRANSPORT (ICALT), 2013, : 411 - 416
12345