Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 659297, 7 pages
http://dx.doi.org/10.1155/2013/659297
Research Article

An Iterated Local Search Algorithm for a Place Scheduling Problem

1School of Economics and Management, Harbin Institute of Technology, Weihai 264209, China
2School of Software, Sun Yat-sen University, Guangzhou 510275, China

Received 15 August 2013; Accepted 9 September 2013

Academic Editor: Yunqiang Yin

Copyright © 2013 Shicheng Hu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Hartmann, “A competitive genetic algorithm for resource-constrained project scheduling,” Naval Research Logistics, vol. 45, no. 7, pp. 733–750, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  2. J. E. Kelley, “The critical-path method: resources planning and scheduling,” Industrial Scheduling, no. 13, pp. 347–365, 1963. View at Google Scholar
  3. R. Alvar-Valdes and J. M. Tamarit, “Heuristic algorithms for resource-constrained project scheduling: a review and empirical analysis,” Advances in Project Scheduling, no. 5, pp. 113–134, 1989. View at Google Scholar
  4. J. Alcaraz and C. Maroto, “A robust genetic algorithm for resource allocation in project scheduling,” Annals of Operations Research, vol. 102, no. 1–4, pp. 83–109, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  5. R. Kolisch, “Serial and parallel resource-constrained project scheduling methods revisited: theory and computation,” European Journal of Operational Research, vol. 90, no. 2, pp. 320–333, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  6. R. Baker, Introduction to Scheduling and Sequencing, John Wiley & Sons, New York, NY, USA, 1974.
  7. A. Mingozzi, V. Maniezzo, S. Ricciardelli, and L. Bianco, “An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation,” Management Science, vol. 44, no. 5, pp. 714–729, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  8. E. K. Burke, G. Kendall, and G. Whitwell, “A new placement heuristic for the orthogonal stock-cutting problem,” Operations Research, vol. 52, no. 4, pp. 655–671, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  9. J. Egeblad and D. Pisinger, “Heuristic approaches for the two- and three-dimensional knapsack packing problem,” Computers and Operations Research, vol. 36, no. 4, pp. 1026–1049, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  10. S. Martello, D. Pisinger, and D. Vigo, “Three-dimensional bin packing problem,” Operations Research, vol. 48, no. 2, pp. 256–267, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  11. G. Ulusoy and L. Özdamar, “A heuristic scheduling algorithm for improving the duration and net present value of a project,” International Journal of Operations and Production Management, vol. 15, no. 1, pp. 89–98, 1995. View at Publisher · View at Google Scholar · View at Scopus
  12. E. W. Davis and J. H. Patterson, “A comparison of heuristic and optimum solutions in resource-constrained project scheduling,” Management Science, vol. 21, no. 8, pp. 944–955, 1975. View at Google Scholar · View at Scopus
  13. T. G. Crainic, G. Perboli, and R. Tadei, “Extreme point-based heuristics for three-dimensional bin packing,” INFORMS Journal on Computing, vol. 20, no. 3, pp. 368–384, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  14. M. W. P. Savelsbergh, “Local search in routing problems with time windows,” Annals of Operations Research, vol. 4, no. 1, pp. 285–305, 1985. View at Publisher · View at Google Scholar · View at Scopus
  15. C. Voudouris and E. Tsang, “Guided local search and its application to the traveling salesman problem,” European Journal of Operational Research, vol. 113, no. 2, pp. 469–499, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  16. A. Schaerf and A. Meisels, “Solving employee timetabling problems by generalized local search,” in Advances in Artificial Intelligence, vol. 1792 of Lecture Notes in Computer Science, pp. 380–389, Springer, New York, NY, USA, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  17. A. Marco, D. O. Montes, C. Carlos, and N. Ferrante, “Local search,” in Handbook of Memetic Algorithms, vol. 24, pp. 21–25, 2012. View at Google Scholar · View at Zentralblatt MATH
  18. G. F. Lucio, M. J. Reed, and I. D. Henning, “Guided local search as a network planning algorithm that incorporates uncertain traffic demands,” Computer Networks, vol. 51, no. 11, pp. 3172–3196, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  19. R. Cabido, A. S. Montemayor, J. J. Pantrigo, and B. R. Payne, “Multiscale and local search methods for real time region tracking with particle filters: local search driven by adaptive scale estimation on GPUs,” Machine Vision and Applications, vol. 21, no. 1, pp. 43–58, 2009. View at Google Scholar
  20. B. Funke, T. Grunert, and S. Irnich, “Local search for vehicle routing and scheduling problems: review and conceptual integration,” Journal of Heuristics, vol. 11, no. 4, pp. 267–306, 2005. View at Publisher · View at Google Scholar
  21. F. Tricoire, “Multi-directional local search,” Computers and Operations Research, vol. 39, no. 12, pp. 3089–3101, 2012. View at Publisher · View at Google Scholar
  22. F. Ricca and B. Simeone, “Local search algorithms for political districting,” European Journal of Operational Research, vol. 189, no. 3, pp. 1409–1426, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  23. P. Mills, E. Tsang, and J. Ford, “Applying an extended guided local search to the quadratic assignment problem,” Annals of Operations Research, vol. 118, no. 1–4, pp. 121–135, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  24. R. Kolisch and A. Sprecher, “PSPLIB—a project scheduling problem library,” European Journal of Operational Research, vol. 96, no. 1, pp. 205–216, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus