Tight bounds for the identical parallel machine-scheduling problem: Part II

International Transactions in Operational Research

Volumn 15, Issue 1, 2008, Pages 19-34

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

^a UNIVERSITY OF CARTHAGE   (Tunisia)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

Branch and bound; Heuristics; Identical parallel machines; Lower bounds; Scheduling

Indexed keywords

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

References (14)

1. Alvim, A.C.F., Ribeiro, C.C., 2004. 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. Dell'Amico, M., Martello, S., 1995. Optimal scheduling of tasks on identical parallel processors. ORSA Journal on Computing 7, 191–200.
3. Dell'Amico, M., Martello, S., 2005. A note on exact algorithms for the identical parallel machine scheduling problem. European Journal of Operational Research 160, 576–578.
4. 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.
5. 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.
6. Haouari, M., Jemmali, M., 2007. Maximizing the minimum completion time on parallel machines. 40R A Quarterly Journal of Operations Research (in press).
7. Haouari, M., Gharbi, A., Jemmali, M., 2006. Tight bounds for the identical parallel machine scheduling problem. International Transactions in Operations Research 13, 529–548.
8. Kellerer, H., Pferschy, U., Pisinger, D., 2004. Knapsack Problems. Springer, Berlin.
9. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D., 1993. Sequencing and Scheduling: Algorithms and Complexity. In Graves, S.S., Rinnooy Kan, A.H.G., Zipkin, P. (eds) Handbooks in Operations Research and Management Science 4, pp. 445–522.
10. Martello, S., Pisinger, D., Toth, P., 1999. Dynamic programming and strong bounds for the 0–1 knapsack problem. Management Science 45, 414–424.
11. Mokotoff, E., 2004. An exact algorithm for the identical parallel machine scheduling problem. European Journal of Operational Research 152, 758–769.
12. Rothkopf, M.H., 1966. Scheduling independent tasks on parallel processors. Management Science 12, 437–447.
13. Sherali, H.D., Smith, J.C., 2001. Improving discrete model representations via symmetry considerations. Management Science 47, 1396–1407.
14. Tang, L., Luo, J., 2006. A new ILS algorithm for parallel machine scheduling problems. Journal of Intelligent Manufacturing 17, 609–619.