Minimizing labor requirements in a periodic vehicle loading problem

Computational Optimization and Applications

Volumn 32, Issue 3, 2005, Pages 299-320

  Delgado, Cristina ^a   Laguna, Manuel ^b   Pacheco, Joaquín ^a  

^a UNIVERSITY OF BURGOS   (Spain)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

Labor requirements; Logistics; Metaheuristics; Multiprocessor scheduling; Periodic vehicle loading problem; Scatter search

Indexed keywords

DECISION MAKING; HEURISTIC METHODS; LOGISTICS; OPTIMIZATION; SCHEDULING; VEHICLES; WAREHOUSES;

LABOR REQUIREMENTS; METAHEURISTICS; MULTIPROCESSOR SCHEDULING; PERIODIC VEHICLE-LOADING PROBLEM; SCATTER SEARCH;

LOADING;

EID: 26044468761     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10589-005-4801-1     Document Type: Article

References (23)

1. B. Adenso-Diaz and M. Laguna, "Fine-tuning of algorithms using fractional experimental designs and local search," to appear in Operations Research.
2. L. Babel, H. Kellerer, and V. Kotov, "The k-partitioning problem," Mathematical Methods of Operations Research, vol. 47, no. 1, pp. 59-82, 1998.
3. J.L. Bentley, "Fast algorithms for geometric traveling salesman problems," INFORMS Journal on Computing, vol. 4, pp. 387-411, 1992.
4. J. Blazewicz, "Selected topics in scheduling theory," Annals of Discrete Mathematics, vol. 31, pp. 1-60, 1987.
5. V. Campos, F. Glover, M. Laguna, and R. Marti, "An experimental evaluation of a scatter search for the linear ordering problem," Journal of Global Optimization, vol. 21, pp. 397-414, 2001.
6. E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson, "An application of bin-packing to multiprocessor scheduling," SIAM Journal on Computing, vol. 7, pp. 1-17, 1978.
7. N. Christofides and J.E. Beasley, "The period routing problem," Networks, vol. 14, pp. 237-256, 1984.
8. M. Dell'amico and S. Martello, "Optimal scheduling of tasks on identical parallel processors," ORSA Journal on Computing, vol. 7, pp. 181-200, 1995.
9. T.A. Feo and M.G.C. Resende, "A probabilistic heuristic for a computationally difficult set covering problem," Operations Research Letters, vol. 8, pp. 67-71, 1989.
10. T.A. Feo and M.G.C. Resende, "Greedy randomized adaptive search procedures," Journal of Global Optimization, vol. 2, pp 1-27, 1995.
11. G. Finn and E. Horowitz, "A linear time approximation algorithms for multiprocessor scheduling," BIT, vol. 19, pp. 312-320, 1979.
12. P. França, M. Gendreau, G. Laporte, and F.M. Muller, "A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective," Computers and Operations Research, vol. 21, no. 2, pp. 205-210, 1994.
13. S. Fujita and M. Yamashita, "Approximation algorithms for multiprocessor scheduling problem," IEICE Trans. Information & Systems, vol. E83-D, no. 3, pp. 503-509, 2000.
14. R.L. Graham, "Bounds on multiprocessing timing anomalies," SIAM Journal on Applied Mathematics, vol. 17, pp. 416-429, 1969.
15. F. Glover, "A template for scatter search and path relinking," in Artificial Evolution, Lecture Notes in Computer Science, 1363, J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers (Eds.), Springer, pp. 13-54, 1998.
16. F. Glover, M. Laguna, and R. Martí, "Fundamentals of scatter search and path relinking," Control and Cybernetics, vol. 39, no. 3, pp. 653-684, 2000.
17. F. Harche and S. Seshadri, "An LPT-bound for a parallel multiprocessor scheduling problem," Journal of Mathematical Analysis and Applications, vol. 196, no. 1, pp. 181-195, 1995.
18. R. Hübscher and F. Glover, "Applying tabu search with influential diversification to multiprocessor scheduling,' Computers and Operations Research, vol. 21, pp. 877-844, 1994.
19. M. Laguna, "Scatter search," in Handbook of Applied Optimization, P.M. Pardalos and M.G.C. Resende (Eds.), Oxford University Press, New York, 2002, pp. 183-193.
20. M.A. Langston, "Improved 0/1 interchange scheduling," BIT, vol. 22, pp. 282-290, 1982.
21. L.S. Pitsoulis and M.G.C. Resende, "Greedy randomized adaptive search procedures," in Handbook of Applied Optimization, P.M. Pardalos and M.G.C. Resende (Eds.), Oxford University Press, New York, 2002, pp. 168-182.
22. S. Sahni, "Algorithms for scheduling independent tasks," Journal of the Association for Computing Machinery, vol. 23, no. 1, pp. 116-127, 1976.
23. A. Thesen, "Design and evaluation of tabu search algorithms for multiprocessor scheduling," Journal of Heuristics, vol. 4, pp. 141-160, 1998.