Abstract
Two stage continuous parallel flow shops with limited intermediate storage are common in process industry. Because of its computational complexity and continuous nature only special cases of the general problem have been solved to optimality so far. The focal point of this paper is the examination of appropriate indirect discrete representations that allow the application of evolutionary methods combined with local search. The results give insight into the most appropriate neighborhood structure and the usefulness of heuristic information for the guidance of the search process. In particular it is shown that the conceived Memetic Algorithm when submitted to a rigid time limit yields better results by using additional heuristic information.
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
Aarts, E. and Korst, J.: Simulated Annealing and Boltzmann Machines. Chichester et al.: John Wiley & Sons (1989)
Anderson, E.J., Glass, C.A. and Potts, C.N.: Machine Scheduling. In Aarts, E., Lentra, K. (Eds.), Local Search in Combinatorial Optimization. John Wiley & Sons. 361–414 (1997)
Baker, J.E: Reducing Bias and Inefficiency in the Selection Algorithm. In Greffenstette (Ed.), Proceedings of the Second International Conference on Genetic Algorithms, (pp. 14–21), Hillsdale, NJ: Lawrence Erlbaum Associates. (1987)
Charalambous, C. and Hindi, K.S.: Applying GAs to Complex Problems: The Case of Scheduling Multi-Stage Intermittent Manufacturing Systems. Proceedings of the Second Int. GALESIA Conference (1997)
Davis L.: Applying Adaptive Algorithms to Epistatic Domains. In Joshi Aravind (Ed.), Proceedings of the International Conference on Artificial Intelligence, (pp. 162–164). Los Altos, California:Morgan Kaufmann Publishers (1985)
Dorigo, M., Di Caro, G. and Gambardella, L.: Ant Algorithms for Discrete Optimization. Artificial Life, 5, 137–172 (1999)
Goldberg D. E.: Genetic algorithms in search, optimization and machine learning. Reading, Mass.: Addison-Wesley (1989)
Holland, J.H.: Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press (1975)
Jain, V. and Grossmann, I.E.: A Disjunctive Model for Schedulingin a Manufacturingand Packing Facility with Intermediate Storage. Optimization and Engineering, 1, 215–231 (2000)
Johnson, D.S. and McGeoch, L.A.: The travelingsalesman problem: a case study in local optimization. In E. H. L. Aarts and J. K. Lenstra (Eds.), Local Search in Optimization, (pp. 215–310). New York: John Wiley and Sons (1997)
Merz, P. and Freisleben, B.: Memetic Algorithms. In D. Corne, M. Dorigo and F. Glover (Eds.), New Ideas in Optimization, (pp. 217–294). London: McGraw-Hill (1999)
Moscato, P.: On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms, C3P Report 826, Pasadena, CA: California Institute of Technology (1989)
Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, Englewood Cliffs, NJ: Prentice Hall, 1995
Pinto, J.M. and Grossmann, I.E.: A continuous time mixed integer linear programmingmo del for short term scheduling of multistage batch plants. Ind. Eng. Chem. Res., 34 (9), 3037–3051 (1995)
Pinto, J.M. and Grossmann, I.E.: Assignment and sequencing models for the scheduling of process systems. Annals of Operations Research, 81, 433–466 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-VerlagBerlin Heidelberg
About this paper
Cite this paper
Bousonville, T. (2002). The Two Stage Continuous Parallel Flow Shop Problem with Limited Storage: Modeling and Algorithms. In: Collet, P., Fonlupt, C., Hao, JK., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2001. Lecture Notes in Computer Science, vol 2310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46033-0_15
Download citation
DOI: https://doi.org/10.1007/3-540-46033-0_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43544-0
Online ISBN: 978-3-540-46033-6
eBook Packages: Springer Book Archive