Suchergebnisse - "iterated greedy algorithm"

  1. 1

    A two-stage iterated greedy algorithm for distributed blocking flowshop scheduling problem von Zhang, Sen, Qian, Bin, Hu, Rong, Li, Kun, Yang, Jian-Bo

    ISSN: 0957-4174
    Veröffentlicht: Elsevier Ltd 05.03.2026
    Veröffentlicht in Expert systems with applications (05.03.2026)
    “… This paper deals with the distributed blocking flowshop scheduling problem (DBFSP), a critical challenge in modern manufacturing systems involving multiple …”
    Volltext
    Journal Article
  2. 2

    A Pareto-based hybrid iterated greedy algorithm for energy-efficient scheduling of distributed hybrid flowshop von Lu, Chao, Liu, Qiao, Zhang, Biao, Yin, Lvjiang

    ISSN: 0957-4174
    Veröffentlicht: Elsevier Ltd 15.10.2022
    Veröffentlicht in Expert systems with applications (15.10.2022)
    “… Due to its practicality, hybrid flowshop scheduling problem (HFSP) with productivity objective has been extensively explored. However, studies on HFSP …”
    Volltext
    Journal Article
  3. 3

    An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem von Huang, Ying-Ying, Pan, Quan-Ke, Huang, Jiang-Ping, Suganthan, PN, Gao, Liang

    ISSN: 0360-8352, 1879-0550
    Veröffentlicht: Elsevier Ltd 01.02.2021
    Veröffentlicht in Computers & industrial engineering (01.02.2021)
    “… •We study a distributed assembly permutation flowshop scheduling problem.•We propose an improved iterative greedy algorithm based on group thinking.•A …”
    Volltext
    Journal Article
  4. 4
  5. 5

    Finding the minimum k-weighted dominating sets using heuristic algorithms von Barrena, E., Bermudo, S., Hernández-Díaz, A.G., López-Sánchez, A.D., Zamudio, J.A.

    ISSN: 0378-4754
    Veröffentlicht: Elsevier B.V 01.02.2025
    Veröffentlicht in Mathematics and computers in simulation (01.02.2025)
    “… In this work, we propose, analyze, and solve a generalization of the k-dominating set problem in a graph, when we consider a weighted graph. Given a graph with …”
    Volltext
    Journal Article
  6. 6
  7. 7

    An improved iterated greedy algorithm for the energy-efficient blocking hybrid flow shop scheduling problem von Qin, Hao-Xiang, Han, Yu-Yan, Zhang, Biao, Meng, Lei-Lei, Liu, Yi-Ping, Pan, Quan-Ke, Gong, Dun-Wei

    ISSN: 2210-6502
    Veröffentlicht: Elsevier B.V 01.03.2022
    Veröffentlicht in Swarm and evolutionary computation (01.03.2022)
    “… •A mathematical model of a blocking hybrid flow shop scheduling problem with energy consumption criteria is proposed.•A simple global perturbation based on a …”
    Volltext
    Journal Article
  8. 8

    An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshop von Zou, Wen-Qiang, Pan, Quan-Ke, Tasgetiren, M. Fatih

    ISSN: 1568-4946, 1872-9681
    Veröffentlicht: Elsevier B.V 01.02.2021
    Veröffentlicht in Applied soft computing (01.02.2021)
    “… In this paper, we address a multi-compartment automatic guided vehicle scheduling (MC-AGVS) problem from a matrix manufacturing workshop that has attracted …”
    Volltext
    Journal Article
  9. 9

    An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance von Mao, Jia-yang, Pan, Quan-ke, Miao, Zhong-hua, Gao, Liang

    ISSN: 0957-4174, 1873-6793
    Veröffentlicht: New York Elsevier Ltd 01.05.2021
    Veröffentlicht in Expert systems with applications (01.05.2021)
    “… •We study a distributed flowshop problem with preventive maintenance.•We present a novel multi-start iterated greedy algorithm.•An improved NEH with dropout is …”
    Volltext
    Journal Article
  10. 10

    Intelligent optimization under blocking constraints: A novel iterated greedy algorithm for the hybrid flow shop group scheduling problem von Qin, Haoxiang, Han, Yuyan, Wang, Yuting, Liu, Yiping, Li, Junqing, Pan, Quanke

    ISSN: 0950-7051, 1872-7409
    Veröffentlicht: Elsevier B.V 22.12.2022
    Veröffentlicht in Knowledge-based systems (22.12.2022)
    “… This paper introduces a new flow shop combinatorial optimization problem, called the blocking hybrid flow shop group scheduling problem (BHFGSP). In the …”
    Volltext
    Journal Article
  11. 11

    An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times von Huang, Jiang-Ping, Pan, Quan-Ke, Gao, Liang

    ISSN: 2210-6502
    Veröffentlicht: Elsevier B.V 01.12.2020
    Veröffentlicht in Swarm and evolutionary computation (01.12.2020)
    “… The distributed permutation flowshop scheduling problem (DPFSP) has attracted much attention in recent years. In this paper, we extend the DPFSP by considering …”
    Volltext
    Journal Article
  12. 12

    An Iterated Greedy Algorithm With Reinforcement Learning for Distributed Hybrid Flowshop Problems With Job Merging von Tao, Xin-Rui, Pan, Quan-Ke, Gao, Liang

    ISSN: 1089-778X, 1941-0026
    Veröffentlicht: IEEE 01.06.2025
    Veröffentlicht in IEEE transactions on evolutionary computation (01.06.2025)
    “… The distributed hybrid flowshop scheduling problems (DHFSPs) widely exist in various industrial production processes, and thus have received widespread …”
    Volltext
    Journal Article
  13. 13

    A tri-individual iterated greedy algorithm for the distributed hybrid flow shop with blocking von Liu, Feige, Li, Guiling, Lu, Chao, Yin, Lvjiang, Zhou, Jiajun

    ISSN: 0957-4174, 1873-6793
    Veröffentlicht: Elsevier Ltd 01.03.2024
    Veröffentlicht in Expert systems with applications (01.03.2024)
    “… Scheduling problem with blocking is an attractive research direction due to its wide practical applications. However, in the distributed hybrid flow shop …”
    Volltext
    Journal Article
  14. 14

    Iterated Greedy Algorithms for Flow-Shop Scheduling Problems: A Tutorial von Zhao, ZiYan, Zhou, MengChu, Liu, ShiXin

    ISSN: 1545-5955, 1558-3783
    Veröffentlicht: New York IEEE 01.07.2022
    “… An iterated greedy algorithm (IGA) is a simple and powerful heuristic algorithm. It is widely used to solve flow-shop scheduling problems (FSPs), an important …”
    Volltext
    Journal Article
  15. 15

    An improved iterated greedy algorithm for distributed robotic flowshop scheduling withorderconstraints von Li, Wenhan, Chen, Xiaolong, Li, Junqing, Sang, Hongyan, Han, Yuyan, Du, Shubo

    ISSN: 0360-8352, 1879-0550
    Veröffentlicht: Elsevier Ltd 01.02.2022
    Veröffentlicht in Computers & industrial engineering (01.02.2022)
    “… •TheDPFSPwithorderandrobot constraints isinvestigated.•Animprovediteratedgreedy(IIG)algorithmisproposedtominimizemakespan.•Several order assignment strategies …”
    Volltext
    Journal Article
  16. 16
  17. 17

    Memetic algorithm for solving flexible flow-shop scheduling problems with dynamic transport waiting times von Lei, Chuanjin, Zhao, Ning, Ye, Song, Wu, Xiuli

    ISSN: 0360-8352, 1879-0550
    Veröffentlicht: Elsevier Ltd 01.01.2020
    Veröffentlicht in Computers & industrial engineering (01.01.2020)
    “… •Developed dynamic waiting time calculation approach (DWC).•Developed machine selection heuristics.•Proposed memetic framework that integrate iterated greedy …”
    Volltext
    Journal Article
  18. 18

    An effective multi-AGVs dispatching method applied to matrix manufacturing workshop von Zhang, Xu-jin, Sang, Hong-yan, Li, Jun-qing, Han, Yu-yan, Duan, Peng

    ISSN: 0360-8352
    Veröffentlicht: Elsevier Ltd 01.01.2022
    Veröffentlicht in Computers & industrial engineering (01.01.2022)
    “… [Display omitted] •A multi-AGVs dispatching method to minimize the transportation cost is addressed.•An improved iterated greedy (IIG) algorithm is …”
    Volltext
    Journal Article
  19. 19

    Heuristic Scheduling of Batch Production Processes Based on Petri Nets and Iterated Greedy Algorithms von Zhao, Ziyan, Liu, Shixin, Zhou, Mengchu, You, Dan, Guo, Xiwang

    ISSN: 1545-5955, 1558-3783
    Veröffentlicht: New York IEEE 01.01.2022
    “… Wire rod and bar rolling is an important batch production process in steel production systems. A scheduling problem originated from this process is studied in …”
    Volltext
    Journal Article
  20. 20