Pages that link to "Item:Q1767711"
From MaRDI portal
The following pages link to Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria (Q1767711):
Displaying 14 items.
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
- Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs (Q1043248) (← links)
- The benefit of preemption for single machine scheduling so as to minimize total weighted completion time (Q1709959) (← links)
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work (Q2025084) (← links)
- On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times (Q2094381) (← links)
- Single-machine scheduling with maintenance activities and rejection (Q2218650) (← links)
- Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
- Equivalence of some different maintenance activities in single-machine scheduling (Q2422132) (← links)
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs (Q2508983) (← links)
- Single-machine scheduling problems with generalized preemption (Q2901041) (← links)
- A short note on the approximation of the single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints (Q3402964) (← links)
- SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES (Q3526523) (← links)
- single Machine Preemptive Scheduling With Special Cost Functions<sup>1</sup> (Q4888275) (← links)
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
