The following pages link to (Q4025613):
Displaying 7 items.
- A branch and bound algorithm to minimize total weighted tardiness on a single processor (Q596449) (← links)
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time (Q1905089) (← links)
- A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios (Q1956478) (← links)
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains (Q2268520) (← links)
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs (Q2638922) (← links)
- Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs (Q3160580) (← links)
