Scheduling multiprocessor tasks to minimise the makespan on two dedicated processors

European Journal of Industrial Engineering

Volumn 4, Issue 3, 2010, Pages 265-279

  Manaa, Adel ^a   Chu, Chengbin ^b  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^b ECOLE CENTRALE PARIS   (France)

Author keywords

Branch and bound; Dedicated processors; Makespan; Multiprocessor task; Scheduling

Indexed keywords

BRANCH AND BOUND METHOD; MULTIPROCESSING SYSTEMS;

BRANCH-AND-BOUND ALGORITHMS; DEDICATED PROCESSORS; DOMINANCE PROPERTIES; MAKESPAN; MULTIPROCESSOR TASKS; OPTIMAL SOLUTIONS; SCHEDULING TASKS; WORST-CASE ANALYSIS;

SCHEDULING;

EID: 77953164737     PISSN: 17515254     EISSN: 17515262     Source Type: Journal    
DOI: 10.1504/EJIE.2010.033331     Document Type: Article

References (18)

1. Amoura, A.K., Bampis, E., Kenyon, C. and Manoussakis, Y. (1997) 'Scheduling independent multiprocessor tasks', European Symposium on Algorithms Proceedings, pp.1-12.
2. Amoura, A.K., Bampis, E., Manoussakis, Y. and Tuza, Z. (1999) 'A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors', Parallel Computing, Vol.25, No.1, pp.49-61.
3. Bampis, E. and Kononov, A. (2001) 'On the approximability of scheduling multiprocessor tasks with time dependent processing and processor requirements', Proceedings of the 15th International Parallel and Distributed Processing Symposium 2001, San Francisco, USA.
4. Bianco, L., Blazewicz, J., Dell'Olmo, P. and Drozdowski, M. (1994) 'Scheduling preemptive multiprocessor tasks on dedicated processors', Performance Evaluation, Vol.20, No.4, pp.361-371.
5. Bianco, L., Blazewicz, J., Dell'Olmo, P. and Drozdowski, M. (1997) 'Preemptive multiprocessor task scheduling with release times and time windows', Annals of Operations Research, Vol.70, No.1, pp.43-55. (Pubitemid 127429148)
6. Blazewicz, J., Dell'Olmo, P. and Drozdowski, M. (2002) 'Scheduling multiprocessor tasks on two parallel processors', RAIRO, Oper. Res., Vol.36, No.1, pp.37-51.
7. Blazewicz, J., Drobowski, M. and Werglaz, J. (1986) 'Scheduling multiprocessor tasks to minimize schedule length', IEEE Transactions on Computers, Vol.35, No.5, pp.383-393.
8. Bozoki, G. and Richard, J.P. (1970) 'A branch-and-bound algorithm for the continuous-process job-shop scheduling problem', 21st Annual Conference of AIIE, Cleveland, May, Vol.II, No.3, pp.246-252.
9. Brücker, P. and Krämer, A. (1996) 'Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems', European Journal of Operational Research, Vol.90, No.2, pp.214-226.
10. Chen, J. and Huang, J. (2001) 'Semi-normal schedulings: improvement on Goemans' algorithm', Proceedings of the 12th International Symposium on Algorithms and Computation, pp.48-60.
11. Dell'Olmo, P., Speranza, M.G. and Tuza, Z. (1997) 'Efficiency and effectiveness of normal schedules on three dedicated processors', Discrete Mathematics, Vol.164, Nos. 1-3, pp.67-79.
12. Drozdowski, M. (1996) 'Scheduling multiprocessor tasks - an overview', European Journal of Operational Research, Vol.94, pp.215-230.
13. Goemans, M.X. (1995) 'An approximation algorithm for scheduling on three dedicated processors', Discrete Applied Mathematics, Vol.61, pp.49-59.
14. Hoogeveen, J.A., van de Velde, S.L. and Veltman, B. (1994) 'Complexity of scheduling multiprocessor tasks with prespecified processor allocations', Discrete Applied Mathematics, Vol.55, pp.259-272.
15. Krämer, A. (1995) 'Scheduling multiprocessor tasks on dedicated processors', PhD thesis, Universität Osnabrück.
16. Krawczyk, H. and Kubale, M. (1985) 'An approximation algorithm for diagnostic test scheduling in multicomputer systems', IEEE Transactions on Computers, Vol.34, No.9, pp.869-872.
17. j', Proceedings of the I4E2 International Conference on Industrial Engineering and Systems Management (IESM'07), Beijing, China.
18. Pinedo, M.L. (2008) Scheduling: Theory, Algorithms, and Systems, 3rd revised edition, Springer-Verlag New York Inc., August, p.24.