Pages that link to "Item:Q1879792"
From MaRDI portal
The following pages link to Parallel machine scheduling under a grade of service provision (Q1879792):
Displaying 50 items.
- 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)
- Coordination mechanisms with hybrid local policies (Q408369) (← links)
- Fast approximation algorithms for job scheduling with processing set restrictions (Q410716) (← 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 jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions (Q834188) (← links)
- Online parallel machines scheduling with two hierarchies (Q837151) (← links)
- Online and semi-online scheduling of two machines under a grade of service provision (Q867934) (← links)
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
- Semi-online hierarchical load balancing problem with bounded processing times (Q897964) (← links)
- A two-stage flow shop scheduling problem with transportation considerations (Q904289) (← 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)
- A comment on parallel-machine scheduling under a grade of service provision to minimize makespan (Q976111) (← links)
- A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs'' (Q987836) (← links)
- A note on graph balancing problems with restrictions (Q990093) (← 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)
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements (Q1680761) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
- Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← links)
- Online scheduling on uniform machines with two hierarchies (Q1928505) (← links)
- Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1 (Q1980488) (← links)
- An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies (Q2014427) (← links)
- Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration (Q2022187) (← links)
- Scheduling jobs with release and delivery times subject to nested eligibility constraints (Q2033983) (← links)
- Worst-case analysis for on-line service policies (Q2268767) (← links)
- Parallel machine scheduling with nested job assignment restrictions (Q2270323) (← links)
- Scheduling equal length jobs with eligibility restrictions (Q2288997) (← links)
- Online fractional hierarchical scheduling on uniformly related machines (Q2333135) (← links)
- Parallel batch scheduling with nested processing set restrictions (Q2402265) (← links)
- Optimal algorithms for semi-online machine covering on two hierarchical machines (Q2441779) (← links)
- Optimal online algorithms for scheduling on two identical machines under a grade of service (Q2508148) (← links)
- Parallel machine scheduling with nested processing set restrictions (Q2655610) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Scheduling uniform machines with restricted assignment (Q2688627) (← links)
- Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes (Q3455876) (← links)
- POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION (Q3646206) (← links)
- PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION (Q3655542) (← links)
- TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION (Q4649879) (← links)
- Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints (Q5188149) (← links)
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)
