Algorithms for no-wait flowshops with total completion time subject to makespan

被引:0
|
作者
机构
[1] Allahverdi, Ali
[2] Aydilek, Harun
来源
Allahverdi, A. (ali.allahverdi@ku.edu.kw) | 1600年 / Springer London卷 / 68期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:9 / 12
相关论文
共 50 条
  • [31] A Metaheuristic for No-wait Flowshops with Variable Processing Times
    Xu, Yi
    Li, Xiaoping
    Shi, Chaomin
    Cui, Mingyu
    Cao, Xincheng
    Ge, Yanyan
    [J]. PROCEEDINGS OF THE 2018 IEEE 22ND INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN ((CSCWD)), 2018, : 479 - 484
  • [32] An algorithm for a no-wait flowshop scheduling problem for minimizing total tardiness with a constraint on total completion time
    Allahverdi, Ali
    Aydilek, Harun
    Aydilek, Asiye
    [J]. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2022, 13 (01) : 43 - 50
  • [33] Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
    Li XiaoPing
    Cheng, Wu
    [J]. SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2008, 51 (07): : 896 - 909
  • [34] Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
    LI XiaoPing1
    2 Key Laboratory of Computer Network and Information Integration (Southeast University)
    3 Department of Automation
    [J]. Science China(Information Sciences), 2008, (07) : 896 - 909
  • [35] Scheduling and lot streaming in flowshops with no-wait in process
    Hall, NG
    Laporte, G
    Selvarajah, E
    Sriskandarajah, C
    [J]. JOURNAL OF SCHEDULING, 2003, 6 (04) : 339 - 354
  • [36] Scheduling and Lot Streaming in Flowshops with No-Wait in Process
    Nicholas G. Hall
    Gilbert Laporte
    Esaignani Selvarajah
    Chelliah Sriskandarajah
    [J]. Journal of Scheduling, 2003, 6 : 339 - 354
  • [37] Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
    XiaoPing Li
    Cheng Wu
    [J]. Science in China Series F: Information Sciences, 2008, 51
  • [38] Minimizing makespan in no-wait job shops
    Bansal, N
    Mahdian, M
    Sviridenko, M
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 2005, 30 (04) : 817 - 831
  • [39] No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
    Allahverdi, Ali
    Aydilek, Harun
    Aydilek, Asiye
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 269 (02) : 590 - 601
  • [40] An effective and efficient heuristic for no-wait flow shop production to minimize total completion time
    Ye, Honghan
    Li, Wei
    Abedini, Amin
    Nault, Barrie
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 108 : 57 - 69