Pages that link to "Item:Q1652026"
From MaRDI portal
The following pages link to Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026):
Displaying 24 items.
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling (Q1628124) (← links)
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233) (← links)
- A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion (Q1652608) (← links)
- Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems (Q1725606) (← links)
- Improved bounded dynamic programming algorithm for solving the blocking flow shop problem (Q1725819) (← links)
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
- Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search (Q2003564) (← links)
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion (Q2004870) (← links)
- Solving permutation flow shop scheduling problem with sequence-independent setup time (Q2176034) (← links)
- Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach (Q2185520) (← links)
- Metaheuristic algorithms for the hybrid flowshop scheduling problem (Q2273670) (← links)
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion (Q2297561) (← links)
- Mixed integer linear programming models for flow shop scheduling with a demand plan of job types (Q2303310) (← links)
- Makespan preserving flowshop reengineering via blocking constraints (Q2329711) (← links)
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260) (← links)
- Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
- A new algorithm for minimizing makespan, <i>C</i><sub>max</sub>, in blocking flow-shop problem through slowing down the operations (Q5292811) (← links)
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (Q6094378) (← links)
- Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization (Q6094862) (← links)
- Dynamic shop-floor scheduling using real-time information: a case study from the thermoplastic industry (Q6109347) (← links)
- Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem (Q6164382) (← links)
- An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times (Q6489312) (← links)
