scientific article; zbMATH DE number 871909

zbMATH Open0845.90071MaRDI QIDQ4875178FDOQ4875178

Leslie A. Hall, David B. Shmoys, Joel Wein

Publication date: 28 April 1996

Title of this publication is not available (Why is that?)

Recommendations

• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
• Approximation techniques for average completion time scheduling
• scientific article; zbMATH DE number 2102785

zbMATH Keywords

precedence constraintssingle-machine schedulingtime-indexed linear programmingtotal weighted job completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (39)

• Title not available (Why is that?)
• Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
• A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting
• Title not available (Why is that?)
• Resource scheduling with variable requirements over time
• Single machine scheduling with release dates
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• News from the online traveling repairman.
• Title not available (Why is that?)
• A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
• Off-line admission control for general scheduling problems
• Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines
• Designing PTASs for MIN-SUM scheduling problems
• Approximate Deadline-Scheduling with Precedence Constraints
• An experimental study of algorithms for weighted completion time scheduling
• Scheduling jobs that arrive over time
• A class of on-line scheduling algorithms to minimize total completion time
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximation techniques for average completion time scheduling
• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
• Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
• The power of \(\alpha\)-points in preemptive single machine scheduling.
• Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
• Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
• LP-based online scheduling: From single to parallel machines
• Approximation algorithms for shop scheduling problems with minsum objective
• A supermodular relaxation for scheduling with release dates
• A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
• Scheduling space-sharing for internet advertising
• Title not available (Why is that?)
• Approximating earliest arrival flows with flow-dependent transit times
• A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
• Approximability of average completion time scheduling on unrelated machines
• Improved results for scheduling batched parallel jobs by using a generalized analysis framework
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
• Resource cost aware scheduling
• Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875178)