The solution algorithms for the multiprocessor scheduling with workspan criterion

Expert Systems with Applications

Volumn 40, Issue 8, 2013, Pages 2799-2806

  Rudek, Radosław ^a   Rudek, Agnieszka ^b   Kozik, Andrzej ^b  

^a WROCLAW UNIVERSITY OF ECONOMICS   (Poland)

^b WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Deteriorating; Learning; Makespan; Multiprocessors; Scheduling; Workspan

Indexed keywords

DETERIORATING; LEARNING; MAKESPAN; MULTIPROCESSORS; WORKSPAN;

DETERIORATION; SCHEDULING; SCHEDULING ALGORITHMS;

PROBLEM SOLVING;

EID: 84874655634     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2012.11.005     Document Type: Article

References (22)

1. J. Błazewicz, J. Wȩglarz, and M. Drabowski Scheduling independent 2-processor tasks to minimize schedule length Information Processing Letters 18 1984 267 273
2. M. Caramia, and S. Giordani A fast metaheuristic for scheduling independent tasks with multiple modes Computers & Operations Research 58 2010 64 69
3. T.C.E. Cheng, Q. Ding, and B.M.T. Lin A concise survey of scheduling with time-dependent processing times European Journal of Operational Research 152 2004 1 13
4. M. Drozdowski Scheduling multiprocessor tasks-an overview European Journal of Operational Research 94 1996 215 230
5. M. Drozdowski Scheduling for parallel processing 2009 Springer London
6. J. Du, and J. Y-T. Leung Complexity of scheduling parallel task systems SIAM Journal on Discrete Mathematics 2 1989 473 487
7. L. Fan, F. Zhang, G. Wang, and Z. Liu An effective approximation algorithm for the malleable parallel task scheduling problem Journal of Parallel and Distributed Computing 72 2012 693 704
8. S. Gawiejnowicz Time-dependent scheduling 2008 Springe-Verlag Berlin
9. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: A survey Annals of Discrete Mathematics 5 1979 287 326
10. Y. Guan, W.-Q. Xiao, R.-K. Cheung, and C.-L. Li A multiprocessor task scheduling model for berth allocation: Heuristic and worst case analysis Operations Research Letters 30 2002 343 350
11. A. Janiak, and R. Rudek A note on the learning effect in multi-agent optimization Expert Systems with Applications 38 2011 5974 5980
12. W.-H. Kuo, and D.-L. Yang Single-machine scheduling problems with start-time dependent processing time Computers and Mathematics with Applications 53 2007 1658 1664
13. P.-J. Lai, and W.-C. Lee Single-machine scheduling with a nonlinear deterioration function Information Processing Letters 110 2010 455 459
14. W.-C. Lee, C.-C. Wu, and H.-C. Liu A note on single-machine makespan problem with general deteriorating function International Journal of Advanced Manufacturing Technology 40 2009 1053 1056
15. M. Nawaz Jr.; E.E. Enscore, and I.A. Ham A heuristic algorithm for m-machine, n-jobs Flow-shop sequencing problem Omega 11 1983 91 95
16. M.D. Toksari, and E. Güner The common due-date early/tardy scheduling problem on a parallel machine under the effects of time-dependent learning and linear and nonlinear deterioration Expert Systems with Applications 37 2010 92 112
17. J. Turek, J.L. Wolf, K.R. Pattipati, and P.S. Yu Scheduling parallelizable tasks: Putting it all on the shelf ACM SIGMETRICS Performance Evaluation Review 20 1996 225 236
18. V.G. Vizing About schedules observing deadlines (in Russian) Kibernetika 1 1981 128 135
19. J.-B. Wang Single machine scheduling with decreasing linear deterioration under precedence constraints Computers and Mathematics with Applications 58 2009 95 103
20. J.-B. Wang, L.-Y. Wang, D. Wang, and X.-Y. Wang Single-machine scheduling with a time-dependent deterioration International Journal of Advanced Manufacturing Technology 43 2009 805 809
21. D.-L. Yang, and W.-H. Kuo Single-machine scheduling with an actual time-dependent learning effect Journal of the Operational Research Society 58 2007 1348 1353
22. D.-L. Yang, and W.-H. Kuo Scheduling with deteriorating jobs and learning effects Applied Mathematics and Computation 218 2011 2069 2073