Scheduling meets n-fold integer programming

Scheduling problems are fundamental in combinatorial optimization. Much work has been done on approximation algorithms for NP-hard cases, but relatively little is known about exact solutions when some part of the input is a fixed parameter. In this paper, we continue this study and show that several...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of scheduling Ročník 21; číslo 5; s. 493 - 503
Hlavní autori:	Knop, Dušan, Koutecký, Martin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.10.2018 Springer Nature B.V
Predmet:	Artificial Intelligence Business and Management Calculus of Variations and Optimal Control; Optimization Combinatorial analysis Integer programming Job shops Operations Research/Decision Theory Optimization Production scheduling Scheduling Supply Chain Management Scheduling on parallel machines 90C10 03D15 Fixed parameterized tractability 90B35
ISSN:	1094-6136, 1099-1425
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!