The solution algorithms for the multiprocessor scheduling with workspan criterion
- 15 June 2013
- journal article
- Published by Elsevier in Expert Systems with Applications
- Vol. 40 (8) , 2799-2806
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- An effective approximation algorithm for the Malleable Parallel Task Scheduling problemJournal of Parallel and Distributed Computing, 2012
- A note on the learning effect in multi-agent optimizationExpert Systems with Applications, 2011
- Single-machine scheduling with a nonlinear deterioration functionInformation Processing Letters, 2010
- Single-machine scheduling problems with start-time dependent processing timeComputers & Mathematics with Applications, 2007
- A concise survey of scheduling with time-dependent processing timesEuropean Journal of Operational Research, 2004
- A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysisOperations Research Letters, 2002
- Scheduling multiprocessor tasks — An overviewEuropean Journal of Operational Research, 1996
- Complexity of Scheduling Parallel Task SystemsSIAM Journal on Discrete Mathematics, 1989
- Scheduling independent 2-processor tasks to minimize schedule lengthInformation Processing Letters, 1984
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979