An Improved Firefly Algorithm for the Unrelated Parallel Machines Scheduling Problem With Sequence-Dependent Setup Times
Research in the area of unrelated parallel machine scheduling problem (UPMSP) with sequence-dependent setup times has received little attention from the research community. However, this problem is NP-hard even without considering the setup times, and when sequence-dependent setup times are included...
Main Authors: | Absalom E. Ezugwu, Francis Akutsah |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2018-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8473691/ |
Similar Items
-
Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem
by: Jesús Isaac Vázquez-Serrano, et al.
Published: (2021-11-01) -
Learning-Based Metaheuristic for Scheduling Unrelated Parallel Machines With Uncertain Setup Times
by: Chen-Yang Cheng, et al.
Published: (2020-01-01) -
Review on unrelated parallel machine scheduling problem with additional resources
by: Munther H. Abed, et al.
Published: (2023-05-01) -
A Statistical Comparison of Metaheuristics for Unrelated Parallel Machine Scheduling Problems with Setup Times
by: Ana Rita Antunes, et al.
Published: (2022-07-01) -
An ordered heuristic for the allocation of resources in unrelated parallel-machines
by: André Serra e Santos, et al.
Published: (2015-04-01)