A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem

被引：0
|
作者：
机构：
[1] Zegordi, S.H.
[2] Itoh, K.
[3] Enkawa, T.
来源：
Zegordi, S.H. | 1600年 / Taylor and Francis Ltd.卷 / 33期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
    Low, C
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (08) : 2013 - 2025
  • [42] A simulated annealing algorithm for multi-objective hybrid flow shop scheduling
    Ma, Shu-Mei
    Sun, Yun
    Li, Ai-Ping
    DESIGN, MANUFACTURING AND MECHATRONICS (ICDMM 2015), 2016, : 1463 - 1473
  • [43] Job Scheduling Problem in a Flow Shop System with Simulated Hardening Algorithm
    Jardzioch, Andrzej
    Skobiej, Bartosz
    ADVANCES IN MANUFACTURING (MANUFACTURING 2017), 2018, : 101 - 109
  • [44] Coupling local search methods and simulated annealing to the job shop scheduling problem with transportation
    Deroussi, L
    Gourgand, M
    Tchernev, N
    ETFA 2001: 8TH IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION, VOL 1, PROCEEDINGS, 2001, : 659 - 667
  • [45] The Improved Simulated Annealing Genetic Algorithm for Flexible Job-Shop Scheduling Problem
    Gu, Xiaolin
    Huang, Ming
    Liang, Xu
    PROCEEDINGS OF 2017 6TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2017), 2017, : 22 - 27
  • [46] A Novel Parallel Simulated Annealing Methodology to Solve the No-Wait Flow Shop Scheduling Problem with Earliness and Tardiness Objectives
    Karacan, Ismet
    Senvar, Ozlem
    Bulkan, Serol
    PROCESSES, 2023, 11 (02)
  • [47] Using a Modified Simulated Annealing Algorithm to Minimize Makespan in a Permutation Flow-shop Scheduling Problem with Job Deterioration
    Seyed-Alagheband, S. A.
    Davoudpour, H.
    Doulabi, S. H. Hashemi
    Khatibi, M.
    WCECS 2009: WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, VOLS I AND II, 2009, : 1232 - 1237
  • [48] Hybrid simulated annealing-slime mould algorithm for the non-permutation flow-shop scheduling problem
    Zhao, Anran
    Liu, Peng
    Gao, Xiyu
    Ding, Denghang
    Huang, Guotai
    ENGINEERING OPTIMIZATION, 2024,
  • [49] AN EFFICIENT SIMULATED ANNEALING FOR A HYBRID FLOW SHOP SCHEDULING PROBLEM WITH SEQUENCE--DEPENDENT SETUP TIMES AND TWO OBJECTIVES
    Mousavi, Seyyed Mostafa
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2021, 28 (02): : 162 - 174
  • [50] The Cyclic Job-Shop Scheduling Problem The New Subclass of the Job-Shop Problem and Applying the Simulated Annealing to Solve It
    Matrenin, P., V
    Manusov, V. Z.
    2016 2ND INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING, APPLICATIONS AND MANUFACTURING (ICIEAM), 2016,
12345