Tight bounds for the identical parallel machine scheduling problem

International Transactions in Operational Research

Volumn 13, Issue 6, 2006, Pages 529-548

  Haouari, Mohamed ^a   Gharbi, Anis ^a,b   Jemmali, Mahdi ^a  

^a UNIVERSITY OF CARTHAGE   (Tunisia)

^b Inst Sup d'Informatique   (Tunisia)

Author keywords

Heuristics; Identical parallel machines; Lower bounds; Scheduling

Indexed keywords

EID: 40649114342     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2006.00562.x     Document Type: Article

References (23)

1. Alvim, A.C.F., Ribeiro, C.C., 2004a. A hybrid bin packing heuristic to multiprocessor scheduling. In: Ribeiro, C.C., Martins, S.L.(eds.), Lecture Notes in Computer Science, Vol. 3059. Springer-Verlag, Berlin, pp.1-13.
2. Alvim, A.C.F., Ribeiro, C.C., 2004b. A hybrid bin packing heuristic to multiprocessor scheduling: Detailed computational results. Available athttp://www.inf.puc-rio.br/%7Ealvim/adriana/publications.html
3. Brucker, P., Hurink, J., Werner, F., 1996. Improving local search heuristics for some scheduling problems. Part I. Discrete Applied Mathematics 65, 97-122.
4. Brucker, P., Hurink, J., Werner, F., 1997. Improving local search heuristics for some scheduling problems. Part II. Discrete Applied Mathematics 72, 47-69.
5. Dell’Amico, M., Martello, S., 1995. Optimal scheduling of tasks on identical parallel processors. ORSA Journal on Computing 7, 191-200.
6. Fekete, S., Schepers, J., 2001. New classes of fast lower bounds for bin packing problems. Mathematical Programming 91, 11-31.
7. França, P.M., Gendreau, M., Laporte, G., Müller, F.M., 1994. A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective. Computers and Operations Research 21, 205-210.
8. Frangioni, A., Necciari, E., Scutellà, M.G., 2004. A multi-exchange neighborhood for minimum makespan machine scheduling problems. Journal of Combinatorial Optimization 8, 195-220.
9. Haouari, M., Gharbi, A., 2004. Lower bounds for scheduling on identical parallel machines with heads and tails. Annals of Operations Research 129, 187-204.
10. Haouari, M., Gharbi, A., 2005. Fast lifting procedures for the bin packing problem. Discrete Optimization 2, 201-218.
11. Ho, J.C., Wong, J.S., 1995. Makespan minimization for m parallel identical processors. Naval Research Logistics 42, 935-948.
12. Hübscher, R., Glover, F., 1994. Applying Tabu Search with influential diversification to multiprocessor scheduling. Computers Operations Research 21, 877-884.
13. Jozefowska, J., Milka, M., Rozycki, R., Waligora, G., Weglarz, J., 1998. Local search metaheuristics for discrete-continuous problems. European Journal of Operational Research 107, 354-370.
14. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D., 1993. Sequencing and scheduling: Algorithms and complexity. Graves, S.S., Rinnooy Kan, A.H.G., Zipkin, P.(eds.)Handbooks in Operations Research and Management Science, 4, North-Holland, Amsterdam, pp.445-522.
15. Martello, S., Toth, P., 1990. Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, New York.
16. McNaughton, R., 1959. Scheduling with deadlines and loss function. Management Science 6, 1-12.
17. Mokotoff, E., 2001. Parallel machine scheduling problems: A survey. Asia-Pacific Journal of Operations Research 18, 193-243.
18. Mokotoff, E., 2004. An exact algorithm for the identical parallel machine scheduling problem. European Journal of Operational Research 152, 758-769.
19. Pisinger, D., 2003. Dynamic programming on the word RAM. Algorithmica 35, 437-459.
20. Rothkopf, M.H., 1966. Scheduling independent tasks on parallel processors. Management Science 12, 437-447.
21. Sahni, S., 1976. Algorithms for scheduling independents tasks. Journal of the Association for Computing Machinery 23, 116-127.
22. Thesen, A., 1998. Design and evaluation of tabu search algorithms for multiprocessor scheduling. Journal of Heuristics 4, 141-160.
23. Webster, S.T., 1996. A general lower bound for the makespan problem. European Journal of Operational Research 89, 516-524.