MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources contraints
| Year of publication: |
2019
|
|---|---|
| Authors: | Ozer, Emine Akyol ; Sarac, Tugba |
| Published in: |
Top : transactions in operations research. - [Berlin] : Springer, ISSN 1134-5764, ZDB-ID 1205918-3. - Vol. 27.2019, 1, p. 94-124
|
| Subject: | Matheuristic | Genetic algorithm | Identical parallel machine scheduling problem | Sequence-dependent setup times | Machine eligibility restrictions | Multiple copies of shared resources | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Durchlaufzeit | Lead time | Evolutionärer Algorithmus | Evolutionary algorithm | Branch-and-Bound | Branch and Bound |
-
Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
Silva, Marco, (2020)
-
A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling
Wang, Shijin, (2015)
-
Muştu, Settar, (2021)
- More ...
-
Ozer, Emine Akyol, (2025)
-
A multi-objective programming approach to 1.5-dimensional assortment problem
Gasimov, Rafail N., (2007)
-
A Discrete Particle Swarm Optimization Algorithm for Bi-Criteria Warehouse Location Problem
Ozsoydan, Fehmi Burcin, (2011)
- More ...