Pages that link to "Item:Q1382806"
From MaRDI portal
The following pages link to Scheduling on identical machines: How good is LPT in an on-line setting? (Q1382806):
Displaying 38 items.
- On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost (Q319441) (← links)
- On-line scheduling on parallel machines to minimize the makespan (Q328085) (← links)
- Online LPT algorithms for parallel machines scheduling with a single server (Q385479) (← links)
- Optimal algorithms for online single machine scheduling with deteriorating jobs (Q442286) (← links)
- Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates (Q473611) (← links)
- Online MapReduce scheduling problem of minimizing the makespan (Q511710) (← links)
- Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan (Q656603) (← links)
- Improved approximation algorithms for parallel machine scheduling with release dates and job rejection (Q681293) (← links)
- A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints (Q714856) (← links)
- Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan (Q721932) (← links)
- Online \(k\)-server routing problems (Q839628) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- On-line scheduling with non-crossing constraints (Q957355) (← links)
- Online scheduling of malleable parallel jobs with setup times on two identical machines (Q976487) (← links)
- A best online algorithm for scheduling on two parallel batch machines (Q1019748) (← links)
- A note on on-line scheduling with precedence constraints on identical machines (Q1607065) (← links)
- Algorithms better than LPT for semi-online scheduling with decreasing processing times (Q1758275) (← links)
- An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints (Q2014051) (← links)
- Makespan minimization with OR-precedence constraints (Q2059086) (← links)
- Heuristics for online scheduling on identical parallel machines with two GoS levels (Q2320626) (← links)
- On-line booking policies and competitive analysis of medical examination in hospital (Q2336398) (← links)
- Online scheduling on two parallel machines with release dates and delivery times (Q2355989) (← links)
- A note on the Coffman-Sethi bound for LPT scheduling (Q2356126) (← links)
- Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan (Q2445903) (← links)
- Competitive analysis for the on-line truck transportation problem (Q2494309) (← links)
- Online scheduling on two parallel identical machines under a grade of service provision (Q2683376) (← links)
- Online Scheduling on Two Parallel Machines with Release Times and Delivery Times (Q2867111) (← links)
- Online scheduling of two type parallel jobs on identical machines (Q3170006) (← links)
- Minimizing makespan on parallel machines with release time and machine eligibility restrictions (Q4823576) (← links)
- (Q5009506) (← links)
- Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms (Q5139609) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)
- An optimal online algorithm for scheduling two machines with release times (Q5958718) (← links)
- LPT online strategy for parallel-machine scheduling with kind release times (Q5963697) (← links)
- Well-behaved online load balancing against strategic jobs (Q6090218) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
- A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing (Q6135730) (← links)