Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product
Year of publication: |
2013
|
---|---|
Authors: | Kellerer, Hans ; Strusevič, Vitalij Aleksandrovič |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 228.2013, 1 (1.7.), p. 24-32
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Biogeography-based optimisation for flexible manufacturing system scheduling problem
Shahla Paslar, (2015)
-
Cui, Haijuan, (2022)
-
Hybrid search and the dial-a-ride problem with transfer scheduling constraints
Schönberger, Jörn, (2015)
- More ...
-
Kellerer, Hans, (2009)
-
Preemptive scheduling on two identical parallel machines with a single transporter
Kellerer, Hans, (2013)
-
Kellerer, Hans, (2013)
- More ...