New heuristic for the flowshop scheduling problem in the presence of bottleneck machine. A performance study

被引:0
|
作者
Han, Wenxue
Dejax, Pierre
机构
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [21] Two-machine flowshop scheduling heuristic with bicriteria objective
    Lee, Ching-En
    Chou, Fuh-Der
    International Journal of Industrial Engineering : Theory Applications and Practice, 1998, 5 (02): : 128 - 139
  • [22] HEURISTICS OF AN N/M/F/CMX SCHEDULING PROBLEM IN THE PRESENCE OF THE BOTTLENECK MACHINE
    HAN, WX
    DEJAX, P
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1990, 24 (04): : 315 - 330
  • [23] A hybrid heuristic algorithm for the no-wait flowshop scheduling problem
    Riahi, Vahid
    Kazemi, Morteza
    CSSE 2015 20th International Symposium on Computer Science and Software Engineering, 2015,
  • [24] Heuristic Different Algorithm for Chemical Parallel Flowshop Scheduling Problem
    Qi, Tang
    Peng, Liu
    2014 SEVENTH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID 2014), VOL 1, 2014, : 130 - 132
  • [26] Bottleneck focused heuristic algorithm for flow shop scheduling problem
    School of Economics and Management, University of Science and Technology Beijing, Beijing 100083, China
    不详
    Jisuanji Jicheng Zhizao Xitong, 1600, 2 (356-363):
  • [27] An improved heuristic for two-machine flowshop scheduling with an availability constraint
    Cheng, TEC
    Wang, GQ
    OPERATIONS RESEARCH LETTERS, 2000, 26 (05) : 223 - 229
  • [28] A flowshop scheduling problem with machine deterioration and maintenance activities
    Rudek, Agnieszka
    Rudek, Radoslaw
    2012 17TH INTERNATIONAL CONFERENCE ON METHODS AND MODELS IN AUTOMATION AND ROBOTICS (MMAR), 2012, : 40 - 45
  • [29] Flowshop scheduling problem with a batching machine and task compatibilities
    Oulamara, A.
    Finke, G.
    Kuiteing, A. Kamgaing
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (02) : 391 - 401
  • [30] Two-machine flowshop group scheduling problem
    Yang, DL
    Chern, MS
    COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (10) : 975 - 985