scientific article; zbMATH DE number 123937
From MaRDI portal
Publication:4025613
Recommendations
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Minimizing the weighted number of tardy jobs on parallel processors
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
- Minimizing the weighted number of tardy jobs on a single machine
Cited in
(13)- Minimizing the weighted sum of squared tardiness on a single machine
- Minimizing the weighted number of tardy jobs on parallel processors
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs
- A branch-bound algorithm to minimize the maximum tardiness with minimum number tardy
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time
- A note on combined job selection and sequencing problems
- A branch and bound algorithm to minimize total weighted tardiness on a single processor
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4025613)
