Pages that link to "Item:Q429486"
From MaRDI portal
The following pages link to New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486):
Displaying 6 items.
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
- Revisiting branch and bound search strategies for machine scheduling problems (Q2464435) (← links)
- Permutation flowshop scheduling with simple linear deterioration (Q5059195) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5898785) (← links)
