An FPTAS of minimizing total weighted completion time on single machine with position constraint

DOI10.4230/LIPIcs.ISAAC.2017.19zbMath1457.68305arXiv1710.10904OpenAlexW2963437911MaRDI QIDQ5136235

No author found.

Publication date: 25 November 2020

Full work available at URL: https://arxiv.org/abs/1710.10904

zbMATH Keywords

schedulingapproximation algorithmFPTAS

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cites Work

• Approximability of scheduling problems with resource consuming jobs
• 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
• Approximation algorithms for inventory constrained scheduling on a single machine
• Minimizing the total weighted completion time in the relocation problem
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
• Complexity of single machine scheduling subject to nonnegative inventory constraints
• Scheduling multiprocessor tasks on parallel processors with limited availability.
• Approximability of total weighted completion time with resource consuming jobs
• Simple matching vs linear assignment in scheduling models with positional effects: a critical review
• Machine scheduling with an availability constraint
• Planning Machine Maintenance in Two-Machine Shop Scheduling
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Scheduling Position-Dependent Maintenance Operations

This page was built for publication: An FPTAS of minimizing total weighted completion time on single machine with position constraint