Using a Modified Simulated Annealing Algorithm to Minimize Makespan in a Permutation Flow-shop Scheduling Problem with Job Deterioration

被引：0
|
作者：
Seyed-Alagheband, S. A. [1 ]
Davoudpour, H. [1 ]
Doulabi, S. H. Hashemi [1 ]
Khatibi, M. [1 ]
机构：
[1] Amirkabir Univ Technol, Dept Ind Engn, Tehran, Iran
来源：
WCECS 2009: WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, VOLS I AND II | 2009年
关键词：
Scheduling; Deteriorating jobs; Simulated Annealing; Meta-heuristics; Makespan; DEPENDENT PROCESSING TIMES; SINGLE-MACHINE; SHOP;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Recently, the problem of scheduling flowshops with linear deteriorating jobs has attracted the attention of researchers. However, due to the computational complexity, there have been few studies in this class of problems having more than two machines. In this paper, we strive to address this problem considering m-machine case. We deployed a modified simulated annealing algorithm to solve this NP-hard problem in a reasonable computation time. Results obtained from the algorithm are an illustration of its high efficiency.
引用
收藏
页码：1232 / 1237
页数：6
相关论文
共 50 条
  • [1] A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem
    Ahmadizar F.
    Barzinpour F.
    [J]. International Journal of Computational Intelligence Systems, 2010, 3 (06) : 853 - 861
  • [2] A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
    Lian, Zhigang
    Gu, Xingsheng
    Jiao, Bin
    [J]. CHAOS SOLITONS & FRACTALS, 2008, 35 (05) : 851 - 861
  • [3] Flow-shop scheduling with exact delays to minimize makespan
    Khatami, Mostafa
    Salehipour, Amir
    Cheng, T. C. E.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 183
  • [4] A hybrid genetic algorithm for job shop scheduling problem to minimize makespan
    Liu, Lin
    Xi, Yugeng
    [J]. WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 3709 - +
  • [5] Transgenic Genetic Algorithm to Minimize the Makespan in the Job Shop Scheduling Problem
    Viana, Monique Simplicio
    Morandin Junior, Orides
    Contreras, Rodrigo Colnago
    [J]. ICAART: PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 2, 2020, : 463 - 474
  • [6] A simulated annealing based beam search algorithm for the flow-shop scheduling problem
    Jin, Feng
    Song, Shi-Ji
    Wu, Cheng
    [J]. INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2008, 22 (01) : 65 - 75
  • [7] A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan
    Wang, Hui-Mei
    Chou, Fuh-Der
    Wu, Ful-Chiang
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 53 (5-8): : 761 - 776
  • [8] MINIMIZING MAKESPAN FOR FLOW-SHOP SCHEDULING BY COMBINING SIMULATED ANNEALING WITH SEQUENCING KNOWLEDGE
    ZEGORDI, SH
    ITOH, KJ
    ENKAWA, T
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 85 (03) : 515 - 531
  • [9] A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan
    Hui-Mei Wang
    Fuh-Der Chou
    Ful-Chiang Wu
    [J]. The International Journal of Advanced Manufacturing Technology, 2011, 53 : 761 - 776
  • [10] A Hybrid Backtracking Search Algorithm for Permutation Flow-Shop Scheduling Problem Minimizing Makespan and Energy Consumption
    Chen, Peng
    Wen, Long
    Li, Ran
    Li, Xinyu
    [J]. 2017 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2017, : 1611 - 1615
12345