An exact parallel method for a bi-objective permutation flowshop problem
From MaRDI portal
Publication:857297
DOI10.1016/j.ejor.2005.10.011zbMath1102.90049DBLPjournals/eor/LemesreDT07OpenAlexW2067559704WikidataQ56920658 ScholiaQ56920658MaRDI QIDQ857297
El-Ghazali Talbi, J. Lemesre, Clarisse Dhaenens
Publication date: 14 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.10.011
Related Items (9)
Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm ⋮ Iterative beam search algorithms for the permutation flowshop ⋮ \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems ⋮ Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm ⋮ Parallel partitioning method (PPM): A new exact method to solve bi-objective problems ⋮ A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem ⋮ A criterion space decomposition approach to generalized tri-objective tactical resource allocation ⋮ Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm ⋮ Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
Cites Work
- Unnamed Item
- Unnamed Item
- Minimizing total tardiness in permutation flowshops
- Multiple and bicriteria scheduling: A literature survey
- A bicriteria two-machine permutation flowshop problem
- Benchmarks for shop scheduling problems
- A genetic algorithm for flowshop sequencing
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Heuristics for scheduling in flowshop with multiple objectives
- A bicriteria approach to the two-machine flow shop scheduling problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Benchmarks for basic scheduling problems
- Proper efficiency and the theory of vector maximization
- Multicriteria scheduling problems: a survey
- Sequencing n Jobs on Two Machines with Arbitrary Time Lags
- Optimal two- and three-stage production schedules with setup times included
- Minimizing Total Tardiness on One Machine is NP-Hard
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
This page was built for publication: An exact parallel method for a bi-objective permutation flowshop problem
