A note on the complexity of the problem of two-agent scheduling on a single machine
- 20 September 2006
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 12 (4) , 387-394
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Scheduling Problems with Two Competing AgentsOperations Research, 2004
- Parallel machine scheduling with high multiplicityMathematical Programming, 2001
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling ProblemOperations Research, 1991
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness1977
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968