ALTERNATIVE CONSTRUCTIVE HEURISTIC ALGORITHM FOR PERMUTATION FLOW-SHOP SCHEDULING PROBLEM WITH MAKE-SPAN CRITERION

被引：0
|
作者：
Modrak, Vladimir [1 ]
Semanco, Pavol [1 ]
Knuth, Peter [1 ]
机构：
[1] TUKE, Fac Mfg Technol, Presov, Slovakia
来源：
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE | 2012年 / 19卷 / 07期
关键词：
make-span; constructive heuristics; genetic algorithm; CPU time; DEPENDENT PROCESSING TIMES; GENETIC ALGORITHM; SEQUENCING PROBLEM; M-MACHINE; N-JOB; SEARCH;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In this paper, a constructive heuristic algorithm is presented to solve deterministic flow-shop scheduling problem with make-span criterion. The algorithm is addressed to an m-machine and n-job permutation flow shop scheduling problem. This paper is composed in a way that the different scheduling approaches to solve flow shop scheduling problems are benchmarked. In order to compare the proposed algorithm against the benchmarked, selected heuristic techniques and genetic algorithm have been used. Results of experiments show that proposed algorithm gives better or at least comparable solutions than benchmarked constructive heuristic techniques. Finally, the average computational times (CPU time in ms) are compared for each size of the problem.
引用
收藏
页码：289 / 296
页数：8
相关论文
共 50 条
  • [21] An effective hyper heuristic-based memetic algorithm for the distributed assembly permutation flow-shop scheduling problem
    Song, Hong-Bo
    Yang, You-Hong
    Lin, Jian
    Ye, Jing-Xuan
    APPLIED SOFT COMPUTING, 2023, 135
  • [22] Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations
    Janiak, A
    Portmann, MC
    ANNALS OF OPERATIONS RESEARCH, 1998, 83 (0) : 95 - 114
  • [23] Solving the Reentrant Permutation Flow-Shop Scheduling Problem with a Hybrid Genetic Algorithm
    Chen, Jen Shiang
    Pan, Jason Chao Hsien
    Lin, Chien Min
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2009, 16 (01): : 23 - 31
  • [24] Invasive Weed Optimization Algorithm for Solving Permutation Flow-Shop Scheduling Problem
    Chen, Huan
    Zhou, Yongquan
    He, Sucai
    Ouyang, Xinxin
    Guo, Peigang
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2013, 10 (03) : 708 - 713
  • [25] ON THE HEURISTIC SOLUTION OF THE PERMUTATION FLOW-SHOP PROBLEM BY PATH ALGORITHMS
    WERNER, F
    COMPUTERS & OPERATIONS RESEARCH, 1993, 20 (07) : 707 - 722
  • [26] AN EXTENSION OF PALMER HEURISTIC FOR THE FLOW-SHOP SCHEDULING PROBLEM
    HUNDAL, TS
    RAJGOPAL, J
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1988, 26 (06) : 1119 - 1124
  • [27] 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
  • [28] Heuristic algorithm for scheduling in the no-wait flow-shop
    Bertolissi, E
    JOURNAL OF MATERIALS PROCESSING TECHNOLOGY, 2000, 107 (1-3) : 459 - 465
  • [29] Note on the behaviour of an improvement heuristic on permutation and blocking flow-shop scheduling
    Companys R.
    Ribas I.
    Mateo M.
    International Journal of Manufacturing Technology and Management, 2010, 20 (1-4) : 331 - 357
  • [30] A Local Search Heuristic with Self-tuning Parameter for Permutation Flow-Shop Scheduling Problem
    Dengiz, Berna
    Alabas-Uslu, Cigdem
    Sabuncuoglu, Ihsan
    2009 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN SCHEDULING: (CI-SCHED), 2009, : 62 - +
12345