Pages that link to "Item:Q829184"
From MaRDI portal
The following pages link to New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184):
Displaying 10 items.
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines (Q6065415) (← links)
- Reducing tardy batches by \textit{seru} production: model, exact solution, cooperative coevolution solution, and insights (Q6068681) (← links)
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
- Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs (Q6112732) (← links)
- A new perspective on single-machine scheduling problems with late work related criteria (Q6160955) (← links)
- Serial batching to minimize the weighted number of tardy jobs (Q6657883) (← links)
