Abstract
In the paper, we proposed and tested a few biomimetic approaches for solving optimization problems derived from the practice of manufacturing. The main considered case is the cyclic flow shop scheduling problem with no-store constraints to minimize cycle time. Special problem properties are also shown. Quality of the proposed biomimetic optimization methods is evaluated in numerous computer tests.
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
Grabowski, J., Pempera, J.: Sequencing of jobs in some production system. European Journal of Operational Research 125, 535–550 (2000)
Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Massachusetts (1997)
Ishubuchi, M., Masaki, S., Tanaka, H.: Modified simulated annealing for the flow shop sequencing problems. European Journal of Operational Research 81, 388–398 (1995)
McCormick, M.L., Pinedo, M.L., Shenker, S., Wolf, B.: Sequencing in an assembly line with blocking to minimize cycle time. Operations Research 37, 925–935 (1989)
Leisten, R.: Flowshop sequencing with limited buffer storage. International Journal of Production Research 28, 2085–2100 (1990)
Nowicki, E.: The permutation flow shop with buffers: A tabu search approach. European Journal of Operational Research 116, 205–219 (1999)
Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research 91, 160–175 (1996)
Ogbu, F.A., Smith, D.K.: The application of the simulated annealing algorithm to the solution n/m/P/C max flow-shop problem. Computers and Operations Research 17, 243–253 (1990)
Osman, I.H., Potts, C.N.: Simulated annealing for permutation flow shop scheduling. OMEGA 17, 551–557 (1989)
Pempera, J., Smutnicki, C.: Minimizing cycle time. The genetic approach with gene expression (Polish). Automatyka 9, 189–199 (2005)
Reeves, C.R.: A genetic algorithm for flow shop sequencing. Computers and Operations Research 22, 5–13 (1995)
Reeves, C.R., Yamada, T.: Genetic algorithms, path relinking and the flowshop sequencing problem. Evolutionary Computation 6, 45–60 (1998)
Smutnicki, C.: A two-machine flow shop scheduling problems with buffers. OR Spectrum 20, 229–235 (1999)
Smutnicki, C.: Scheduling algorithms (Polish). EXIT, Warszawa (2002)
Taillard, E.: Some efficient heuristic methods for flow-shop sequencing. European Journal of Operational Research 47, 65–74 (1990)
Taillard, E.: Home page. Internet, http://www.eivd.ch/ina/collaborateurs/etd/default.htm
Watson, J.P., Barbulescu, L., Whitley, L.D., Hove, A.E.: Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. INFORMS Journal of Computing 14, 98–123 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smutnicki, C. (2012). Biomimetic Optimizers for Job Scheduling. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2011. EUROCAST 2011. Lecture Notes in Computer Science, vol 6928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27579-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-27579-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27578-4
Online ISBN: 978-3-642-27579-1
eBook Packages: Computer ScienceComputer Science (R0)