A strong integer programming formulation for hybrid flowshop scheduling
Year of publication: |
2020
|
---|---|
Authors: | Ünal, A. Tamer ; Ağralı, Semra ; Taşkın, Z. Caner |
Published in: |
Journal of the Operational Research Society. - London : Taylor and Francis, ISSN 1476-9360, ZDB-ID 2007775-0. - Vol. 71.2020, 12, p. 2042-2052
|
Subject: | co-bipartite chain graph | conflict graph | decision support system | Hybrid flowshop scheduling | integer programming | interval graph | maximal clique | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming | Management-Informationssystem | Management information system | Evolutionärer Algorithmus | Evolutionary algorithm |
-
Inderfurth, Karl, (2000)
-
Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
Zhou, Qing, (2025)
-
A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
Bianchessi, Nicola, (2021)
- More ...
-
Mathematical programming-based sales and operations planning at Vestel Electronics
Taşkın, Z. Caner, (2015)
-
Employee scheduling in service industries with flexible employee availability and demand
Ağralı, Semra, (2017)
-
Taşkın, Z. Caner, (2009)
- More ...