Approximability of total weighted completion time with resource consuming jobs

DOI10.1016/j.orl.2015.09.004zbMath1408.90133OpenAlexW1747656568MaRDI QIDQ1785443

Tamás Kis

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/26096/1/weighted_compl_rev2.pdf

zbMATH Keywords

schedulingapproximation algorithmsnon-renewable resource

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Minimizing makespan on a single machine with release dates and inventory constraints ⋮ Approximation schemes for parallel machine scheduling with non-renewable resources ⋮ EPTAS for load balancing problem on parallel machines with a non-renewable resource ⋮ Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints ⋮ A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource ⋮ New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints ⋮ EPTAS for load balancing problem on parallel machines with a non-renewable resource ⋮ A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing ⋮ An FPTAS of minimizing total weighted completion time on single machine with position constraint

Cites Work

• Unnamed Item
• Exact algorithms for inventory constrained scheduling on a single machine
• Approximation schemes for single machine scheduling with non-renewable resource constraints
• Reductions between scheduling problems with non-renewable resources and knapsack problems
• Single machine scheduling problems with financial resource constraints: some complexity results and properties
• Complexity of single machine scheduling subject to nonnegative inventory constraints
• Scheduling subject to nonrenewable-resource constraints
• Structure of a simple scheduling polyhedron
• Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
• Basic scheduling problems with raw material constraints
• The Complexity of Flowshop and Jobshop Scheduling
• Handbook on Scheduling

This page was built for publication: Approximability of total weighted completion time with resource consuming jobs