Permutation flowshop problem with time lags scheduling by logic-based Benders decomposition

被引：0
|
作者：
Hamdi, Imen [1 ]
Loukil, Taicir [1 ]
机构：
[1] Fac Econ Sci & Management, Dept Quantitat Methods, Sfax, Tunisia
来源：
2013 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT) | 2013年
关键词：
Scheduling; Permutation flowshop; Time lags; Benders decomposition; LATE JOBS; NUMBER; ALGORITHM; MINIMIZE;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：851 / 856
页数：6
相关论文
共 50 条
  • [1] Logic-based Benders decomposition to solve the permutation flowshop scheduling problem with time lags
    Hamdi, Imen
    Loukil, Taicir
    2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), 2013,
  • [2] Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
    Hamdi, Imen
    Loukil, Taicir
    OPTIMIZATION LETTERS, 2015, 9 (03) : 465 - 482
  • [3] Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
    Bektas, Tolga
    Hamzadayi, Alper
    Ruiz, Ruben
    JOURNAL OF SCHEDULING, 2020, 23 (04) : 513 - 523
  • [4] Lagrangian relaxation for the permutation flowshop scheduling problem with minimal and maximal time lags
    Hamdi, Imen
    Loukil, Taicir
    2014 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2014, : 42 - 47
  • [5] Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
    Imen Hamdi
    Taïcir Loukil
    Optimization Letters, 2015, 9 : 465 - 482
  • [6] An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
    Hamzadayi, Alper
    COMPUTERS & OPERATIONS RESEARCH, 2020, 123 (123)
  • [7] Logic-based benders decomposition for scheduling a batching machine
    Emde, Simon
    Polten, Lukas
    Gendreau, Michel
    COMPUTERS & OPERATIONS RESEARCH, 2020, 113 (113)
  • [8] Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
    Tolga Bektaş
    Alper Hamzadayı
    Rubén Ruiz
    Journal of Scheduling, 2020, 23 : 513 - 523
  • [9] Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags
    Imen Hamdi
    Taicir Loukil
    Operational Research, 2015, 15 : 95 - 114
  • [10] Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags
    Hamdi, Imen
    Loukil, Taicir
    OPERATIONAL RESEARCH, 2015, 15 (01) : 95 - 114
12345