Pages that link to "Item:Q867934"
From MaRDI portal
The following pages link to Online and semi-online scheduling of two machines under a grade of service provision (Q867934):
Displayed 24 items.
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (Q358659) (← links)
- Semi-online scheduling problems on two uniform machines under a grade of service provision (Q388114) (← links)
- Semi-online scheduling with two GoS levels and unit processing time (Q389944) (← links)
- A note on hierarchical scheduling on two uniform machines (Q604878) (← links)
- Online hierarchical scheduling: an approach using mathematical programming (Q621843) (← links)
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times (Q626449) (← links)
- Online and semi-online hierarchical scheduling for load balancing on uniform machines (Q631770) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- Online parallel machines scheduling with two hierarchies (Q837151) (← links)
- Online scheduling on two uniform machines subject to eligibility constraints (Q837188) (← links)
- Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
- The hierarchical model for load balancing on two machines (Q927189) (← links)
- Online scheduling on parallel machines with two goS levels (Q941832) (← links)
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan (Q975438) (← links)
- Online scheduling on two uniform machines to minimize the makespan (Q1019187) (← links)
- Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
- Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488) (← links)
- Online scheduling on uniform machines with two hierarchies (Q1928505) (← links)
- Optimal algorithms for semi-online machine covering on two hierarchical machines (Q2441779) (← links)
- OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION (Q2905313) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)