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.
This research has been financed by the Spanish Ministry of Science and Technology under contract no. DPI2000-0567 and by the Australian Research Council under IREX award 2000-X1562.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiex R. M., Resende M.G.C., Pardalos P.M., Toraldo G. (2000). “GRASP With Path Relinking For The Three-Index Assignment,” IPDPS Workshops.
Arking E.M., Silverberg E.B., (1987). “Scheduling jobs with fixed start and end times,” Discrete Applied Mathematics 18, pp. 1–8.
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.
Feo T., Venkatraman K. and Bard J., (1991). “A GRASP for a difficult single machine scheduling problem,” Computers and Operations Research, 18.
Feo T.A. and M.G.C. Resende, (1995). “Greedy Randomized Adaptative Search Procedures,” Journal of Global Optimization 6, pp. 109–133.
Fischetti M., Martello S., Toth P., (1992). “Approximation algorithms for fixed job schedule problems,” Operations Research 40 /1, pp. S96 - S108.
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.
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.
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.
Hashimoto A. and Stevens J., (1971). “Wirw routing by optimizing channel assignments within apertures,” in: Proceedings of the 8th Design Automation Workshop, pp. 155169.
Kolen W.J., Kroon L.G., (1991). “On the computational complexity of (maximum) class scheduling,” European Journal of Operations Research 54, pp. 23–38.
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.
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.
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.
Resende M.G.C., (1998). “Computing Approximate Solutions of the Maximum Covering Problem with GRASP,” Journal of Heuristic 4, pp. 161–177.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
García, J.M., Smith, K., Lozano, S., Guerrero, F. (2002). A Comparison of GRASP and an Exact Method for Solving a Production and Delivery Scheduling Problem. In: Abraham, A., Köppen, M. (eds) Hybrid Information Systems. Advances in Soft Computing, vol 14. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1782-9_31
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1782-9_31
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1480-4
Online ISBN: 978-3-7908-1782-9
eBook Packages: Springer Book Archive