Pages that link to "Item:Q380558"
From MaRDI portal
The following pages link to A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558):
Displaying 15 items.
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
- Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
- A study on the enhanced best performance algorithm for the just-in-time scheduling problem (Q1723298) (← links)
- Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases (Q1993121) (← links)
- Stochastic single machine scheduling problem as a multi-stage dynamic random decision process (Q2051165) (← links)
- Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
- Multi-machine scheduling lower bounds using decision diagrams (Q2294251) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines (Q2398650) (← links)
- New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives (Q2424773) (← links)
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
- Equitable scheduling on a single machine (Q6103750) (← links)
- Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs (Q6112732) (← links)
- Server cloud scheduling (Q6130327) (← links)
