scientific article; zbMATH DE number 871909
From MaRDI portal
Publication:4875178
zbMath0845.90071MaRDI QIDQ4875178
Leslie A. Hall, David B. Shmoys, Joel M. Wein
Publication date: 28 April 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
single-machine schedulingprecedence constraintstime-indexed linear programmingtotal weighted job completion time
Related Items
Resource scheduling with variable requirements over time ⋮ Approximate Deadline-Scheduling with Precedence Constraints ⋮ Unnamed Item ⋮ An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ Approximating earliest arrival flows with flow-dependent transit times ⋮ News from the online traveling repairman. ⋮ GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times ⋮ Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints ⋮ Improved results for scheduling batched parallel jobs by using a generalized analysis framework ⋮ Approximability of average completion time scheduling on unrelated machines ⋮ A supermodular relaxation for scheduling with release dates ⋮ Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds ⋮ Resource cost aware scheduling ⋮ A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ Designing PTASs for MIN-SUM scheduling problems ⋮ A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints ⋮ A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting ⋮ Interval-indexed formulation based heuristics for single machine total weighted tardiness problem ⋮ Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates ⋮ LP-based online scheduling: From single to parallel machines ⋮ A Survey on Approximation Algorithms for Scheduling with Machine Unavailability ⋮ Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines ⋮ Off-line admission control for general scheduling problems ⋮ Scheduling space-sharing for internet advertising ⋮ The power of \(\alpha\)-points in preemptive single machine scheduling. ⋮ Approximation algorithms for shop scheduling problems with minsum objective
