Pages that link to "Item:Q1964484"
From MaRDI portal
The following pages link to Approximability of scheduling with fixed jobs (Q1964484):
Displayed 17 items.
- Minimizing total weighted completion time with an unexpected machine unavailable interval (Q398911) (← links)
- Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
- Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
- Approximability of single machine scheduling with fixed jobs to minimize total completion time (Q857360) (← links)
- Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption (Q881562) (← links)
- Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
- Scheduling on uniform processors with at most one downtime on each machine (Q1751114) (← links)
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria (Q1767711) (← links)
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
- Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
- Single machine unbounded parallel-batch scheduling with forbidden intervals (Q2426551) (← links)
- Multi-agent scheduling on a single machine with max-form criteria (Q2470117) (← links)
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs (Q2508983) (← links)
- MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS (Q3397506) (← links)
- SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES (Q3526523) (← links)
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
- Approximation algorithms for scheduling with reservations (Q5961975) (← links)