The constrained minimum weighted sum of job completion times problem

DOI10.1007/s10107-005-0691-3zbMath1098.90032OpenAlexW2153966571MaRDI QIDQ2494511

Asaf Levin, Gerhard J. Woeginger

Publication date: 28 June 2006

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0691-3

zbMATH Keywords

Combinatorial optimizationSchedulingApproximation scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (1)

On the minimum \(s-t\) cut problem with budget constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strongly polynomial-time approximation for a class of bicriteria problems.
• An approximation algorithm for the generalized assignment problem
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Structure of a simple scheduling polyhedron
• Combinatorial Optimization with Rational Objective Functions
• Single-Machine Scheduling Polyhedra with Precedence Constraints
• Approximation Schemes for the Restricted Shortest Path Problem
• Bicriteria Network Design Problems
• Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
• Slowing down sorting networks to obtain faster sorting algorithms
• Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis

This page was built for publication: The constrained minimum weighted sum of job completion times problem