Pages that link to "Item:Q3826352"
From MaRDI portal
The following pages link to Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs (Q3826352):
Displaying 26 items.
- Preemptive scheduling of two uniform parallel machines to minimize total tardiness (Q439607) (← links)
- Minimizing the number of late jobs on unrelated machines (Q811339) (← links)
- Minimizing makespan and preemption costs on a system of uniform machines (Q818662) (← links)
- Scheduling equal processing time jobs to minimize the weighted number of late jobs (Q853793) (← links)
- Optimal preemptive scheduling on uniform machines with discounted flowtime objectives (Q856258) (← links)
- An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552) (← links)
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q922286) (← links)
- Preemptive scheduling on uniform machines to minimize mean flow time (Q1017456) (← links)
- Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines (Q1040089) (← links)
- Minimizing the number of tardy jobs for \(m\) parallel machines (Q1127174) (← links)
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- A note on the maximum number of on-time jobs on parallel identical machines. (Q1422366) (← links)
- Scheduling on uniform parallel machines to minimize maximum lateness (Q1577473) (← links)
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem (Q1771351) (← links)
- A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs (Q1891237) (← links)
- Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem (Q1962067) (← links)
- Scheduling with limited machine availability (Q1969884) (← links)
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
- A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)
- Shop scheduling problems with pliable jobs (Q2294890) (← links)
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs (Q2304114) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Minimizing total tardiness on parallel machines with preemptions (Q2434279) (← links)
- Preemptive scheduling with deadlines on parallel machines (Q2917044) (← links)
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques (Q3740552) (← links)
