Pages that link to "Item:Q817122"
From MaRDI portal
The following pages link to A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122):
Displayed 6 items.
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems (Q1038288) (← links)
- An optimization-based heuristic for the robotic cell problem (Q1040983) (← links)
- Surgical case scheduling as a generalized job shop scheduling problem (Q2464181) (← links)
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers (Q2475841) (← links)
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers (Q3596695) (← links)