A hybrid heuristic solution based on simulated annealing algorithm for energy efficient single machine scheduling problem with sequence dependent setup times

被引:3
|
作者
Bektur, Gulcin [1 ]
机构
[1] Iskenderun Tech Univ, Ind Engn, TR-31200 Antakya, Turkey
关键词
Energy efficient single machine scheduling; epsilon-constraint method; multi-objective heuristic algorithm; sequence dependent setup times; multi-objective mathematical model; TARDY JOBS; MINIMIZE; CONSUMPTION; NUMBER; TARDINESS; COST;
D O I
10.17341/gazimmfd.598082
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Increased carbon dioxide emissions and energy consumption increase interest in energy efficient scheduling problems. In this study, speed scaling method is discussed in order to provide energy saving in multiobjective energy efficient single machine scheduling problem. In the literature with the speed scaling method, the energy consumption rate increases when the machine is operated at high speed, but the job is completed in a shorter time. When the machine is operate at low speed, the energy consumption rate decreases but the completion time of the jobs are prolonged. In the study, the objective functions are minimization of the total amount of energy consuption and the number of tardy jobs. The problem is defined by the scheduling problem in a manufacturing firm that produces plastic parts. Jobs have a sequence dependent setup times, and the setup time of a job depends on the job completed before it. A mathematical model is proposed for the problem. The epsilon-constraint method is used for the solution of the problem. All Pareto efficient solutions for small size problems are obtained by using the proposed heuristic method. However, as a result of the problem not being solved in polynomial time, a multi-objective heuristic algorithm is proposed for solving large-scale problems. The success of the proposed algorithm is shown by comparing with Non- dominated Sorting Genetic Algorithm II.
引用
收藏
页码:407 / 420
页数:14
相关论文
共 50 条
  • [21] Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
    Gagné, C
    Price, WL
    Gravel, M
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (08) : 895 - 906
  • [22] Fast and efficient algorithms to handle the dynamism in a single machine scheduling problem with sequence-dependent setup times
    Angel-Bello, Francisco
    Vallikavungal, Jobish
    Alvarez, Ada
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 152
  • [23] Uniform Parallel Machine Scheduling with Sequence Dependent Setup Times: A Randomized Heuristic
    Yildiz, Beste
    Kandiller, Levent
    Toy, Ayhan Ozgur
    DIGITIZING PRODUCTION SYSTEMS, ISPR2021, 2022, : 812 - 825
  • [24] An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times
    Yalaoui, F
    Chu, CB
    IIE TRANSACTIONS, 2003, 35 (02) : 183 - 190
  • [25] Genetic Algorithm for single machine scheduling problem with setup times
    OuYang, Quan
    Xu, HongYun
    FRONTIERS OF MECHANICAL ENGINEERING AND MATERIALS ENGINEERING II, PTS 1 AND 2, 2014, 457-458 : 1678 - 1681
  • [26] General flowshop scheduling problem with the sequence dependent setup times: A heuristic approach
    Ziaee, Mohsen
    INFORMATION SCIENCES, 2013, 251 : 126 - 135
  • [27] A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times
    Franca, PM
    Gendreau, M
    Laporte, G
    Muller, FM
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1996, 43 (2-3) : 79 - 89
  • [28] Cloud theory-based simulated annealing for a single-machine past sequence setup scheduling with scenario-dependent processing times
    Chin-Chia Wu
    Win-Chin Lin
    Xin-Gong Zhang
    Dan-Yu Bai
    Yung-Wei Tsai
    Tao Ren
    Shuenn-Ren Cheng
    Complex & Intelligent Systems, 2021, 7 : 345 - 357
  • [29] Cloud theory-based simulated annealing for a single-machine past sequence setup scheduling with scenario-dependent processing times
    Wu, Chin-Chia
    Lin, Win-Chin
    Zhang, Xin-Gong
    Bai, Dan-Yu
    Tsai, Yung-Wei
    Ren, Tao
    Cheng, Shuenn-Ren
    COMPLEX & INTELLIGENT SYSTEMS, 2021, 7 (01) : 345 - 357
  • [30] A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
    Gendreau, M
    Laporte, G
    Guimaraes, EM
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 133 (01) : 183 - 189