Pages that link to "Item:Q2459401"
From MaRDI portal
The following pages link to Minimizing makespan on an \(m\)-machine re-entrant flowshop (Q2459401):
Displaying 19 items.
- Practical solutions for a dock assignment problem with trailer transportation (Q319870) (← links)
- Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times (Q337017) (← links)
- Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
- Minimizing total completion time for re-entrant flow shop scheduling problems (Q650903) (← links)
- Optimal solutions for a dock assignment problem with trailer transportation (Q744629) (← links)
- On the connection between a cyclic job shop and a reentrant flow shop scheduling problem (Q880555) (← links)
- Minimizing total tardiness on a two-machine re-entrant flowshop (Q1042154) (← links)
- A heuristic algorithm for two-machine re-entrant shop scheduling (Q1290158) (← links)
- Re-entrant flowshop scheduling with learning considerations to minimize the makespan (Q1787748) (← links)
- Flow shops with reentry: reversibility properties and makespan optimal schedules (Q2282537) (← links)
- A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA-VNS algorithm (Q2292161) (← links)
- Multi-objective reentrant hybrid flowshop scheduling with machines turning on and off control strategy using improved multi-verse optimizer algorithm (Q2298225) (← links)
- Multi-family scheduling in a two-machine reentrant flow shop with setups (Q2467261) (← links)
- A review of re-entrant scheduling problems (Q3462917) (← links)
- Mean Flow Time Minimization in Reentrant Job Shops with a Hub (Q4345597) (← links)
- Minimizing Makespan in a Class of Reentrant Shops (Q4393117) (← links)
- Minimizing makespan in re-entrant permutation flow-shops (Q4661115) (← links)
- Minimizing makespan on a two-machine re-entrant flowshop (Q5428997) (← 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)
