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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of scheduling Vol. 21; no. 5; pp. 493 - 503
Main Authors:	Knop, Dušan, Koutecký, Martin
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2018 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!