A Comparison of GRASP and an Exact Method for Solving a Production and Delivery Scheduling Problem
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.
Unable to display preview. Download preview PDF.
- 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
- Feo T., Venkatraman K. and Bard J., (1991). “A GRASP for a difficult single machine scheduling problem,” Computers and Operations Research, 18.Google Scholar
- 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
- 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