Abstract
This paper deals with the problem of selecting and scheduling a set of orders to be processed by a manufacturing plant and immediately delivered to the customer site. Constraints to be considered are the limited production capacity, the available number of vehicles and the time windows within which orders must be served. We describe the problem relating it to similar problems studied in the literature. A genetic algorithm to solve the problem is developed and tested empirically with randomly generated problems. Comparisons with an exact procedure and a tabu search procedure show that the method finds very good-quality solutions.
This research has been financed by the Spanish Ministry of Science and Technology under contract no. DPI2000-0567.
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.
Similar content being viewed by others
References
Hall N.G. and Sriskandarajah C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44, (1996) 510–525.
Sriskandarajah C.: Performance of scheduling algorithms for no-wait flowshops with parallel machines. European Journal of Operations Research, 70, (1993) 365–378.
Ramudhin A. and Ratliff H.D.: Generating daily production schedules in process industries. IIE Transactions, 27, (1995) 646–656.
Kroon L.G., Salomon M. and Van Wassenhove L. N.: Exact and approximation algorithms for the operational fixed interval scheduling problem. European Journal of Operational Research, 82, (1995) 190–205.
Gertsbakh I. and Stern H.: Minimal Resources for Fixed and Variable Job Schedules. Operations Research, 26 (1), (1978) 68–85.
Gabrel V.: Scheduling jobs within time windows on identical parallel machines: New model and algorithms. European Journal of Operations Research, 83, (1995) 320–329.
Goldberg, D. E.: Genetic Algorithms in Search, Optimization, and Machine Learning. (1989). New York, NY: Addison-Wesley.
Garcia J. M., Smith K., Lozano S. and Guerrero F.: A Comparison of GRASP and an Exact Method for Solving a Production and Delivery Scheduling Problem. Proceedings of the International workshop on Hybrid Intelligent Systems HIS’2001, Adelaide, Australia. (2001).
Arking E.M., Silverberg E.B.: Scheduling jobs with fixed start and end times. Discrete Applied Mathematics 18, (1987) 1–8.
Kaufmann, M.: Fundations of Genetic Algorithms. Edited by Gregory J.E. Rawlins, San Mateo California, (1991).
Garcia J. M., Smith K., Lozano S., Guerrero F. and Calle M.: Production and Delivery Scheduling Problem with Time Windows. Proceedings of The 30-th International Conference on Computers and Industrial Engineering, Tynos Island, Greece (2002) 263–268.
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
Manuel Garcia, J., Lozano, S., Guerrero, F., Eguia, I. (2002). A Genetic Algorithm for Solving a Production and Delivery Scheduling Problem with Time Windows. In: Garijo, F.J., Riquelme, J.C., Toro, M. (eds) Advances in Artificial Intelligence — IBERAMIA 2002. IBERAMIA 2002. Lecture Notes in Computer Science(), vol 2527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36131-6_38
Download citation
DOI: https://doi.org/10.1007/3-540-36131-6_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00131-7
Online ISBN: 978-3-540-36131-2
eBook Packages: Springer Book Archive