On optimizing a bi-objective flowshop scheduling problem in an uncertain environment
From MaRDI portal
Publication:356401
DOI10.1016/j.camwa.2012.02.051zbMath1268.90020WikidataQ59262724 ScholiaQ59262724MaRDI QIDQ356401
Jérémie Humeau, Matthieu Basseur, El-Ghazali Talbi, Laetitia Jourdan, Arnaud Liefooghe
Publication date: 25 July 2013
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2012.02.051
evolutionary algorithms; multi-objective combinatorial optimization; uncertain processing times; permutation flowshop scheduling
90C29: Multi-objective and goal programming
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
Related Items
Uses Software
Cites Work
- Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation
- Evolutionary computation in dynamic and uncertain environments.
- Evolutionary multi-criterion optimization. 4th international conference, EMO 2007, Matsushima, Japan, March 5--8, 2007. Proceedings
- Evolutionary multiobjective optimization in noisy problem environments
- Multiple and bicriteria scheduling: A literature survey
- Robust discrete optimization and its applications
- Benchmarks for basic scheduling problems
- Multicriteria scheduling problems: a survey
- Minimizing Total Tardiness on One Machine is NP-Hard
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- The Lessons of Flowshop Scheduling Research
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
