Pages that link to "Item:Q2178110"
From MaRDI portal
The following pages link to A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110):
Displaying 12 items.
- Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
- Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (Q5057997) (← links)
- On some lower bounds for the permutation flowshop problem (Q6047866) (← links)
- Distributed assembly permutation flow-shop scheduling problem with sequence-dependent set-up times using a novel biogeography-based optimization algorithm (Q6048133) (← links)
- Shop scheduling in manufacturing environments: a review (Q6060656) (← links)
- Maximizing total early work in a distributed two‐machine flow‐shop (Q6078603) (← links)
- Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion (Q6103746) (← links)
- Manufacturing rescheduling after crisis or disaster-caused supply chain disruption (Q6106575) (← links)
- A branch-and-bound approach to the no-idle flowshop scheduling problem (Q6202953) (← links)
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion (Q6551067) (← links)
- Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns (Q6588509) (← links)
