Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
From MaRDI portal
Publication:1960313
Recommendations
- A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
- An exact method to minimize the number of tardy jobs in single machine scheduling
- Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
- Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
- Scheduling on parallel identical machines to minimize total tardiness
Cited in
(21)- Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine
- Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
- Single machine scheduling with batch set-up times to minimize maximum lateness
- Single machine scheduling to minimize the number of late jobs under uncertainty.
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- Single machine rescheduling for new orders with maximum lateness minimization
- Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
- An exact method to minimize the number of tardy jobs in single machine scheduling
- Multicriteria scheduling
- Fuzzy bi-criteria scheduling on parallel machines involving weighted flow time and maximum tardiness
- Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
- A branch-bound algorithm to minimize the maximum tardiness with minimum number tardy
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
- Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
- Single machine group scheduling with family setups to minimize total tardiness
- Scheduling on parallel identical machines to minimize total tardiness
- A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
- A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
This page was built for publication: Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1960313)
