New multi-objective method to solve reentrant hybrid flow shop scheduling problem
From MaRDI portal
Recommendations
- Reentrant hybrid flowshop scheduling problem based on total weighted completion time
- Efficient methods to schedule re-entrant flowshop system
- scientific article; zbMATH DE number 7028188
- A multi-objective optimization model and its algorithm for hybrid parallel machine scheduling problems
- Genetic local search for multi-objective flowshop scheduling problems
Cites work
- A decision-theoretic approach to robust optimization in multivalued graphs
- A genetic algorithm for a bi-objective capacitated arc routing problem
- Approximation methods in multiobjective programming
- Decentralised, multi-objective driven scheduling for reentrant shops: a conceptual development and a test case
- Equitable aggregations and multiple criteria analysis
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
- Inequalities: theory of majorization and its applications
- Linear optimization with multiple equitable criteria
- Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
- Mixed binary integer programming formulations for the reentrant job shop scheduling problem
- Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches
- Multi-family scheduling in a two-machine reentrant flow shop with setups
- On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
- On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
- Some complexity results in cyclic scheduling
Cited in
(26)- Efficient methods to schedule re-entrant flowshop system
- Lorenz dominance based algorithms to solve a practical multiobjective problem
- scientific article; zbMATH DE number 6001874 (Why is no real title available?)
- Decentralised, multi-objective driven scheduling for reentrant shops: a conceptual development and a test case
- A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation
- Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm
- Efficient algorithms for flexible job shop scheduling with parallel machines
- Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions
- Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time
- Game theory based evolutionary algorithms: a review with Nash applications in structural engineering optimization problems
- Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem
- Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem
- Inequity averse optimization in operational research
- Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
- A holonic approach to flexible flow shop scheduling under stochastic processing times
- Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm
- 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
- scientific article; zbMATH DE number 7233676 (Why is no real title available?)
- Reentrant hybrid flowshop scheduling problem based on total weighted completion time
- An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem
- scientific article; zbMATH DE number 7028188 (Why is no real title available?)
- A systematic review of multi-objective hybrid flow shop scheduling
- Multi-objective reentrant hybrid flowshop scheduling with machines turning on and off control strategy using improved multi-verse optimizer algorithm
- 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
- Fair optimization and networks: a survey
This page was built for publication: New multi-objective method to solve reentrant hybrid flow shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043329)
