Scheduling meets n-fold integer programming
- 15 November 2017
- journal article
- research article
- Published by Springer Nature in Journal of Scheduling
- Vol. 21 (5) , 493-503
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Grantová Agentura, Univerzita Karlova (1784214)
- Grantová Agentura C(eské Republiky (CZ) (17-09142S, P202/12/G061)
- Grantová Agentura, Univerzita Karlova (338216)
- Univerzita Karlova v Praze (SVV-2017-260452)
This publication has 30 references indexed in Scilit:
- Graver basis and proximity techniques for block-structured separable convex integer minimization problemsMathematical Programming, 2013
- Bin packing with fixed number of bins revisitedJournal of Computer and System Sciences, 2013
- Fifty years of scheduling: a survey of milestonesJournal of the Operational Research Society, 2009
- Complexity of preemptive minsum scheduling on unrelated parallel machinesJournal of Algorithms, 2005
- On the parametric complexity of schedules to minimize tardy tasksTheoretical Computer Science, 2003
- Two-Dimensional Gantt Charts and a Scheduling Algorithm of LawlerSIAM Journal on Discrete Mathematics, 2000
- W[2]-hardness of precedence constrained K-processor schedulingOperations Research Letters, 1995
- Chapter 9 Sequencing and scheduling: Algorithms and complexity1993
- Convex separable optimization is not much harder than linear optimizationJournal of the ACM, 1990
- Scheduling independent tasks to reduce mean finishing timeCommunications of the ACM, 1974