A NEW HEURISTIC METHOD FOR THE FLOW-SHOP SEQUENCING PROBLEM

被引：228
|
作者：
WIDMER, M
HERTZ, A
机构：
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1989年 / 41卷 / 02期
关键词：
D O I：
10.1016/0377-2217(89)90383-4
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：186 / 193
页数：8
相关论文
共 50 条
  • [21] A two-phase heuristic approach to the permutation flow-shop scheduling problem
    Suliman, SMA
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2000, 64 (1-3) : 143 - 152
  • [22] ELIMINATION CONDITIONS AND LOWER BOUNDS FOR THE PERMUTATION FLOW-SHOP SEQUENCING PROBLEM
    越民义
    韩继业
    陈永茂
    Acta Mathematicae Applicatae Sinica, 1985, (04) : 321 - 331
  • [23] A Reinforcement Learning Method for a Hybrid Flow-Shop Scheduling Problem
    Han, Wei
    Guo, Fang
    Su, Xichao
    ALGORITHMS, 2019, 12 (11)
  • [24] SPECIAL CASES OF FLOW-SHOP PROBLEM
    SZWARC, W
    NAVAL RESEARCH LOGISTICS, 1977, 24 (03) : 483 - 492
  • [25] DIFFERENT APPROACHES TO A FLOW-SHOP PROBLEM
    OLHAGER, J
    RAPP, B
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 75 (02) : 469 - 473
  • [26] An Improved Heuristic Algorithm for a Hybrid Flow-shop Scheduling
    Dai, Min
    Tang, Dunbing
    Zheng, Kun
    Cai, Qixiang
    MEASUREMENT TECHNOLOGY AND ENGINEERING RESEARCHES IN INDUSTRY, PTS 1-3, 2013, 333-335 : 1414 - 1417
  • [27] A fuzzy greedy heuristic for permutation flow-shop scheduling
    Sheibani, K.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2010, 61 (05) : 813 - 818
  • [28] OPTIMAL AND HEURISTIC MODELS FOR LOT SPLITTING IN A FLOW-SHOP
    KROPP, DH
    SMUNT, TL
    DECISION SCIENCES, 1990, 21 (04) : 691 - 709
  • [29] A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem
    Lin, Jian
    Wang, Zhou-Jing
    Li, Xiaodong
    SWARM AND EVOLUTIONARY COMPUTATION, 2017, 36 : 124 - 135
  • [30] Effective Constructive Heuristic and Metaheuristic for the Distributed Assembly Blocking Flow-shop Scheduling Problem
    Zhongshi Shao
    Weishi Shao
    Dechang Pi
    Applied Intelligence, 2020, 50 : 4647 - 4669
12345