Pages that link to "Item:Q1406627"
From MaRDI portal
The following pages link to Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. (Q1406627):
Displaying 15 items.
- Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints (Q367232) (← links)
- Hybrid flowshop scheduling with machine and resource-dependent processing times (Q534872) (← links)
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
- Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling (Q870153) (← links)
- The flow shop scheduling polyhedron with setup times (Q1417853) (← links)
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics (Q1776952) (← links)
- Two models for a family of flowshop sequencing problems (Q1848365) (← links)
- Scheduling flexible flow lines with sequence-dependent setup times (Q1876159) (← links)
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times (Q2146995) (← links)
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260) (← links)
- A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (Q2572851) (← links)
- A branch-and-cut approach for the distributed no-wait flowshop scheduling problem (Q2676404) (← links)
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times (Q3163716) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- Flowshop with additional resources during setups: mathematical models and a GRASP algorithm (Q6109559) (← links)
