The following pages link to (Q3907409):
Displaying 6 items.
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
- Parallel approximation schemes for subset sum and knapsack problems (Q1084863) (← links)
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs (Q1667779) (← links)
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains (Q2268520) (← links)
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains (Q2355078) (← links)
- Approximation algorithms for combinatorial fractional programming problems (Q4726063) (← links)
