An exact parallel method for a bi-objective permutation flowshop problem

DOI10.1016/J.EJOR.2005.10.011MaRDI QIDQ857297zbMATH OpenOpenAlexDBLPWikidataFDO

Authors J. Lemesre, El-Ghazali Talbi, 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

zbMATH Keywords

exact methodpermutation flowshopparallel methodbi-objective combinatorial optimization problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Recommendations

• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
• Two branch and bound algorithms for the permutation flow shop problem
• Combining metaheuristics and exact methods for solving exactly multi-objective problems on the grid
• \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 915988 (Why is no real title available?)
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• A bicriteria approach to the two-machine flow shop scheduling problem
• A bicriteria two-machine permutation flowshop problem
• A genetic algorithm for flowshop sequencing
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Benchmarks for basic scheduling problems
• Benchmarks for shop scheduling problems
• Heuristics for scheduling in flowshop with multiple objectives
• Minimizing Total Tardiness on One Machine is NP-Hard
• Minimizing total tardiness in permutation flowshops
• Multicriteria scheduling problems: a survey
• Multiple and bicriteria scheduling: A literature survey
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Proper efficiency and the theory of vector maximization
• Sequencing \(n\) jobs on two machines with arbitrary time lags
• The Complexity of Flowshop and Jobshop Scheduling
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem

Cited in

(11)

• Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
• A criterion space decomposition approach to generalized tri-objective tactical resource allocation
• Iterative beam search algorithms for the permutation flowshop
• A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
• Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
• Combining metaheuristics and exact methods for solving exactly multi-objective problems on the grid
• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
• \(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
• Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm

This page was built for publication: An exact parallel method for a bi-objective permutation flowshop problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857297)