论文信息 - Tight bounds for the identical parallel machine-scheduling problem: Part II - 字舞流文

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

Mohamed Haouari | Mahdi Jemmali | M. Haouari | M. Jemmali

[1] Maria Grazia Scutellà,et al. A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems , 2004, J. Comb. Optim..

[2] Hanif D. Sherali,et al. Improving Discrete Model Representations via Symmetry Considerations , 2001, Manag. Sci..

[3] S. Martello,et al. Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .

[4] Michael H. Rothkopf,et al. Scheduling Independent Tasks on Parallel Processors , 1966 .

[5] Michel Gendreau,et al. A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective , 1994, Comput. Oper. Res..

[6] Mohamed Haouari,et al. Tight bounds for the identical parallel machine scheduling problem , 2006, Int. Trans. Oper. Res..

[7] Mauro Dell'Amico,et al. A note on exact algorithms for the identical parallel machine scheduling problem , 2005, Eur. J. Oper. Res..

[8] Lixin Tang,et al. A new ILS algorithm for parallel machine scheduling problems , 2006, J. Intell. Manuf..

[9] Mauro Dell'Amico,et al. Optimal Scheduling of Tasks on Identical Parallel Processors , 1995, INFORMS J. Comput..

[10] Ethel Mokotoff,et al. Production , Manufacturing and Logistics An exact algorithm for the identical parallel machine scheduling problem , 2003 .