Pages that link to "Item:Q809880"
From MaRDI portal
The following pages link to Branch and bound algorithm for the flow shop with multiple processors (Q809880):
Displaying 14 items.
- A two-stage hybrid flow shop with dedicated machines at the first stage (Q336642) (← links)
- Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage (Q337499) (← links)
- An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation (Q506145) (← links)
- Minimizing total completion time in two-stage hybrid flow shop with dedicated machines (Q622160) (← links)
- A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem (Q730912) (← links)
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
- Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
- A taxonomy of flexible flow line scheduling procedures (Q859681) (← links)
- Modeling realistic hybrid flexible flowshop scheduling problems (Q941540) (← links)
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria (Q954034) (← links)
- Minimizing makespan in two-stage hybrid cross docking scheduling problem (Q1001000) (← links)
- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
- Scheduling of a single crane in batch annealing process (Q1017463) (← links)
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
