Pages that link to "Item:Q1604056"
From MaRDI portal
The following pages link to List scheduling in a parallel machine environment with precedence constraints and setup times (Q1604056):
Displaying 11 items.
- A flow-based tabu search algorithm for the RCPSP with transfer times (Q280159) (← links)
- Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis (Q817121) (← links)
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints (Q833543) (← links)
- Parallel machine scheduling with precedence constraints and setup times (Q991370) (← links)
- Two-stage hybrid flowshop scheduling with simultaneous processing machines (Q1617273) (← links)
- Bounds for parallel machine scheduling with predefined parts of jobs and setup time (Q1708539) (← links)
- Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints (Q1721157) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- An exact branch-and-price approach for the medical student scheduling problem (Q2668624) (← links)
- Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions (Q3163694) (← links)
- Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds (Q5232862) (← links)
