Pages that link to "Item:Q496647"
From MaRDI portal
The following pages link to Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times (Q496647):
Displaying 12 items.
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
- A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines (Q1752453) (← links)
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225) (← links)
- Scheduling with limited machine availability (Q1969884) (← links)
- Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines (Q2289001) (← links)
- Scheduling a single machine with primary and secondary objectives (Q2331605) (← links)
- Homogeneously non-idling schedules of unit-time jobs on identical parallel machines (Q2446341) (← links)
- No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines (Q2668758) (← links)
- A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan (Q5244301) (← links)
- On scheduling with the non-idling constraint (Q5895181) (← links)
- On scheduling with the non-idling constraint (Q5925167) (← links)
- Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan (Q6594026) (← links)
