Abstract
We consider a fuzzy variant of the permutational flow shop scheduling problem in which uncertain values of operations durations are represented by fuzzy numbers. Since even deterministic problem is strongly NP-hard, we propose a tabu search based metaheuristics with the new fuzzy blocks properties for neighborhood searching acceleration.
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
1. Bożejko W., Pempera J., Smutnicki C.: Parallel simulated annealing for the job shop scheduling problem. In: Allen G et al. (Eds.) ICCS 2009, Part I, Lecture Notes in Computer Science No. 5544, Springer (2009), 631–640.
2. Bożejko W.: Solving the flow shop problem by parallel programming. Journal of Parallel and Distributed Computing 69 (2009) 470–481.
3. Bożejko W., Wodecki M.: Parallel path-relinking method for the flow shop scheduling problem. Lecture Notes in Computer Science No. 5101, Springer (2008), 264–273.
4. Bożejko W., Wodecki M.: Parallel scatter search algorithm for the flow shop sequencing problem. Lecture Notes in Computer Science No. 4967, Springer (2008), 180–188.
5. Bożejko W., Hejducki Z., Wodecki M.: Fuzzy blocks in genetic algorithm for the flow shop problem. In Proceedings of the Conference on Human System Interaction HSI’08, IEEE Computer Society, 1-4244-1543-8/08/ IEEE (2008).
6. Bożejko W., Rajba P., Wodecki M.: Scheduling problem with uncertain parameters in Just in Time system. Lecture Notes in Artificial Intelligence No. 8468, Springer (2014), 456–467.
7. Garey M.R., Johnson D.S., Seti R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1 (1976), 117–129.
8. Grabowski J., Wodecki M.: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers & Operations Research 31 (2004), 1891–1909.
9. Herroelen W., Leus E.: Project Scheduling under Uncertainty: Survey and Research Potentials. European Journal of Operational Research 165(2) (2005), 289–306.
10. Nowicki E., Smutnicki C.: A fast tabu search algorithm for the permutation flow shop problem. European Journal of Operational Research 91 (1996), 160–175.
11. Taillard E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993), 278–285.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Bożejko, W., Gniewkowski, Ł., Wodecki, M. (2017). Blocks for the flow shop scheduling problem with uncertain parameters. In: Mitkowski, W., Kacprzyk, J., Oprzędkiewicz, K., Skruch, P. (eds) Trends in Advanced Intelligent Control, Optimization and Automation. KKA 2017. Advances in Intelligent Systems and Computing, vol 577. Springer, Cham. https://doi.org/10.1007/978-3-319-60699-6_68
Download citation
DOI: https://doi.org/10.1007/978-3-319-60699-6_68
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60698-9
Online ISBN: 978-3-319-60699-6
eBook Packages: EngineeringEngineering (R0)