Complexities of Some Problems on Multi-agent Scheduling on a Single Machine
- 16 March 2016
- journal article
- research article
- Published by Springer Nature in Journal of the Operations Research Society of China
- Vol. 4 (3) , 379-384
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (NSFC (11271338))
- National Natural Science Foundation of China (71301038)
- Natural Science Foundation of Henan Province (NSF-Henan (15IRTSTHN006))
This publication has 4 references indexed in Scilit:
- Multiagent Scheduling2014
- Scheduling Problems with Two Competing AgentsOperations Research, 2004
- A Multiple-Criterion Model for Machine SchedulingJournal of Scheduling, 2003
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness1977