Makespan minimization on unrelated parallel machines with a few bags
Authors:
- Daniel R. PageDPDaniel R. Page
- Roberto Solis-ObaRSRoberto Solis-Oba
- 1 June 2020
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 821, 34-44
Abstract
No abstract availableKeywords
Funding Information
- Natural Sciences and Engineering Research Council of Canada (04667-2015)
This publication has 15 references indexed in Scilit:
- The 2-valued case of makespan minimization with assignment constraintsInformation Processing Letters, 2013
- Approximating the multi-level bottleneck assignment problemOperations Research Letters, 2012
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegreeJournal of Combinatorial Optimization, 2009
- Scheduling with conflicts: online and offline algorithmsJournal of Scheduling, 2008
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machinesTheoretical Computer Science, 2007
- Parallel machine scheduling of machine-dependent jobs with unit-lengthEuropean Journal of Operational Research, 2004
- Scheduling with incompatible jobsDiscrete Applied Mathematics, 1994
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979