New multi-objective method to solve reentrant hybrid flow shop scheduling problem
From MaRDI portal
Publication:1043329
DOI10.1016/j.ejor.2009.06.031zbMath1176.90205OpenAlexW2033739616MaRDI QIDQ1043329
Frédéric Dugardin, Lionel Amodeo, Farouk Yalaoui
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.06.031
schedulinggenetic algorithmmulti-criteria optimizationLorenz dominanceequitable dominancereentrant shops
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Related Items (17)
Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm ⋮ Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem ⋮ Inequity averse optimization in operational research ⋮ A holonic approach to flexible flow shop scheduling under stochastic processing times ⋮ An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes ⋮ Bicriteria scheduling problem for unrelated parallel machines with release dates ⋮ Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration ⋮ An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem ⋮ Efficient algorithms for flexible job shop scheduling with parallel machines ⋮ A systematic review of multi-objective hybrid flow shop scheduling ⋮ Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem ⋮ Lorenz dominance based algorithms to solve a practical multiobjective problem ⋮ Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm ⋮ A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation ⋮ Game theory based evolutionary algorithms: a review with Nash applications in structural engineering optimization problems ⋮ Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs ⋮ Fair optimization and networks: a survey
Uses Software
Cites Work
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
- On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
- Some complexity results in cyclic scheduling
- Equitable aggregations and multiple criteria analysis
- A decision-theoretic approach to robust optimization in multivalued graphs
- Multi-family scheduling in a two-machine reentrant flow shop with setups
- Mixed binary integer programming formulations for the reentrant job shop scheduling problem
- Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches
- A genetic algorithm for a bi-objective capacitated arc routing problem
- Decentralised, multi-objective driven scheduling for reentrant shops: a conceptual development and a test case
- Approximation methods in multiobjective programming
- Linear optimization with multiple equitable criteria
- On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
- Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
- Inequalities: theory of majorization and its applications
This page was built for publication: New multi-objective method to solve reentrant hybrid flow shop scheduling problem
