Advertisement

A Comparison of GRASP and an Exact Method for Solving a Production and Delivery Scheduling Problem

  • J. M. García
  • K. Smith
  • S. Lozano
  • F. Guerrero
Part of the Advances in Soft Computing book series (AINSC, volume 14)

Abstract

In this paper we consider the production and delivery scheduling problem, a problem that deals with the selection of orders to be processed by a manufacturing plant and immediately delivered to the customer site. Orders have a fixed due date and must be prepared in a single plant with limited capacity. A limited number of vehicles are available for delivery. A ready-mix concrete manufacturing case study has motivated this research. We describe an exact method to find optimal solutions based on the construction of a graph that collects all feasible solutions. We also describe a greedy randomized adaptive search (GRASP) for the problem that finds good, though not necessarily optimal, solutions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aiex R. M., Resende M.G.C., Pardalos P.M., Toraldo G. (2000). “GRASP With Path Relinking For The Three-Index Assignment,” IPDPS Workshops.Google Scholar
  2. Arking E.M., Silverberg E.B., (1987). “Scheduling jobs with fixed start and end times,” Discrete Applied Mathematics 18, pp. 1–8.MathSciNetCrossRefGoogle Scholar
  3. Chen, B., (1995). “Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage,” Journal of Operational Research Society, Vol. 46, pp. 234–244.zbMATHGoogle Scholar
  4. Feo T., Venkatraman K. and Bard J., (1991). “A GRASP for a difficult single machine scheduling problem,” Computers and Operations Research, 18.Google Scholar
  5. Feo T.A. and M.G.C. Resende, (1995). “Greedy Randomized Adaptative Search Procedures,” Journal of Global Optimization 6, pp. 109–133.MathSciNetzbMATHCrossRefGoogle Scholar
  6. Fischetti M., Martello S., Toth P., (1992). “Approximation algorithms for fixed job schedule problems,” Operations Research 40 /1, pp. S96 - S108.MathSciNetCrossRefGoogle Scholar
  7. Gabrel V., (1995). “Scheduling jobs within time windows on identical parallel machines: New model and algorithms,” European Journal of Operations Research 83, pp. 320–329.zbMATHCrossRefGoogle Scholar
  8. Gupta, J. N. D., and Tunc, E. A., (1991). “Schedules for a Two-Stage Hybrid Flowshop with Parallel Machines at the Second Stage,” International Journal of Production Research, Vol. 29, No. 7, pp. 1489–1502.CrossRefGoogle Scholar
  9. Gupta J.N.D., Hariri A.M.A. and Potts C.N. (1997). “Scheduling a Two-Stage Flow Shop with Parallel Machines at the First Stage”, An Oper Res; 69: pp. 171–191.zbMATHCrossRefGoogle Scholar
  10. Hashimoto A. and Stevens J., (1971). “Wirw routing by optimizing channel assignments within apertures,” in: Proceedings of the 8th Design Automation Workshop, pp. 155169.Google Scholar
  11. Kolen W.J., Kroon L.G., (1991). “On the computational complexity of (maximum) class scheduling,” European Journal of Operations Research 54, pp. 23–38.zbMATHCrossRefGoogle Scholar
  12. Kroon L.G., Salomon M., Van Wassenhove L. N., (1995). “Exact and approximation algorithms for the operational fixed interval scheduling problem,” European Journal of Operational Research 82, pp. 190–205.zbMATHCrossRefGoogle Scholar
  13. Laguna M. and Gonzalez-Velarde, (1991). “A search heuristic for just-in-time scheduling in parallel machines” Journal of Intelligent Manufacturing 2, pp. 253–260.CrossRefGoogle Scholar
  14. Ramudhin, A., Ratliff, H. D., (1992). “Generating Daily Production Schedules in Process Industries,” Working paper 92–51, Faculté des Sciences de L’Administration, Université Laval, Québec, Canada.Google Scholar
  15. Resende M.G.C., (1998). “Computing Approximate Solutions of the Maximum Covering Problem with GRASP,” Journal of Heuristic 4, pp. 161–177.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • J. M. García
    • 1
  • K. Smith
    • 2
  • S. Lozano
    • 1
  • F. Guerrero
    • 1
  1. 1.Escuela Superior de IngenierosUniversity of SevilleSevilleSpain
  2. 2.School of Business SystemsMonash UniversityClaytonAustralia

Personalised recommendations