Scheduling on identical machines: How good is LPT in an on-line setting?
From MaRDI portal
Publication:1382806
DOI10.1016/S0167-6377(97)00040-0zbMath0892.90098WikidataQ126551220 ScholiaQ126551220MaRDI QIDQ1382806
Publication date: 18 March 1998
Published in: Operations Research Letters (Search for Journal in Brave)
Related Items
Online scheduling of two type parallel jobs on identical machines ⋮ Online \(k\)-server routing problems ⋮ On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost ⋮ On-line scheduling on parallel machines to minimize the makespan ⋮ Minimizing makespan on parallel machines with release time and machine eligibility restrictions ⋮ Scheduling parallel jobs to minimize the makespan ⋮ Online LPT algorithms for parallel machines scheduling with a single server ⋮ Well-behaved online load balancing against strategic jobs ⋮ The LPT heuristic for minimizing total load on a proportionate openshop ⋮ Online scheduling on two parallel identical machines under a grade of service provision ⋮ A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing ⋮ Unnamed Item ⋮ Optimal algorithms for online single machine scheduling with deteriorating jobs ⋮ Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan ⋮ Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan ⋮ Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates ⋮ Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Online MapReduce scheduling problem of minimizing the makespan ⋮ Improved approximation algorithms for parallel machine scheduling with release dates and job rejection ⋮ On-line scheduling with non-crossing constraints ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints ⋮ Online scheduling of malleable parallel jobs with setup times on two identical machines ⋮ Competitive analysis for the on-line truck transportation problem ⋮ A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints ⋮ Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan ⋮ An optimal online algorithm for scheduling two machines with release times ⋮ LPT online strategy for parallel-machine scheduling with kind release times ⋮ A best online algorithm for scheduling on two parallel batch machines ⋮ Makespan minimization with OR-precedence constraints ⋮ Heuristics for online scheduling on identical parallel machines with two GoS levels ⋮ On-line booking policies and competitive analysis of medical examination in hospital ⋮ Online Scheduling on Two Parallel Machines with Release Times and Delivery Times ⋮ A note on on-line scheduling with precedence constraints on identical machines ⋮ Online scheduling on two parallel machines with release dates and delivery times
Cites Work
