Pages that link to "Item:Q1579123"

The following pages link to Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123):

Displaying 16 items.

• Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times (Q337017) (← links)
• Scheduling algorithms for a semiconductor probing facility (Q609817) (← links)
• Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (Q857354) (← links)
• Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication (Q880579) (← links)
• Heuristic algorithms for two machine re-entrant flow shop (Q930923) (← links)
• Minimizing total tardiness on a two-machine re-entrant flowshop (Q1042154) (← links)
• A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines (Q1743651) (← links)
• Decomposition algorithms for synchronous flow shop problems with additional resources and setup times (Q1751897) (← links)
• Flow shops with reentry: reversibility properties and makespan optimal schedules (Q2282537) (← links)
• Minimizing makespan on an \(m\)-machine re-entrant flowshop (Q2459401) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• Applying machine based decomposition in 2-machine flow shops (Q2572846) (← links)
• Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study (Q3605414) (← links)
• Measures of subproblem criticality in decomposition algorithms for shop scheduling (Q4460042) (← 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)
• Metaheuristics for solving a flexible flow-shop scheduling problem with s-batching machines (Q6609697) (← links)