Pages that link to "Item:Q2482800"
From MaRDI portal
The following pages link to A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates (Q2482800):
Displaying 13 items.
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- A branch-and-check approach for a wind turbine maintenance scheduling problem (Q1651530) (← links)
- A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem (Q1686431) (← links)
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling (Q1752822) (← links)
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
- Branch less, cut more and minimize the number of late equal-length jobs on identical machines (Q1929241) (← links)
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling (Q2189876) (← links)
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
- Branch-and-check approaches for the tourist trip design problem with rich constraints (Q2669676) (← links)
- Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5713895) (← links)
- Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition (Q6081826) (← links)
- A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty (Q6103748) (← links)
