Pages that link to "Item:Q1043329"
From MaRDI portal
The following pages link to New multi-objective method to solve reentrant hybrid flow shop scheduling problem (Q1043329):
Displaying 23 items.
- Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm (Q279989) (← links)
- Inequity averse optimization in operational research (Q319581) (← links)
- A holonic approach to flexible flow shop scheduling under stochastic processing times (Q336906) (← links)
- Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) (← links)
- Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration (Q342119) (← links)
- Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm (Q474788) (← links)
- Game theory based evolutionary algorithms: a review with Nash applications in structural engineering optimization problems (Q724768) (← links)
- Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem (Q1639843) (← links)
- 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 (Q1652033) (← links)
- Lorenz dominance based algorithms to solve a practical multiobjective problem (Q1725590) (← links)
- A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation (Q1998264) (← links)
- Fair optimization and networks: a survey (Q2336590) (← links)
- Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs (Q2514766) (← links)
- Decentralised, multi-objective driven scheduling for reentrant shops: a conceptual development and a test case (Q2566702) (← links)
- (Q3109339) (← links)
- (Q3306319) (← links)
- (Q4623871) (← links)
- An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem (Q6066726) (← links)
- Efficient algorithms for flexible job shop scheduling with parallel machines (Q6093557) (← links)
- A systematic review of multi-objective hybrid flow shop scheduling (Q6112731) (← links)
- Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem (Q6164382) (← links)
- 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 (Q6588502) (← links)
- Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time (Q6593195) (← links)
