Single machine controllable scheduling with bounded makespan

DOI10.1016/J.TCS.2025.115642MaRDI QIDQ6884329zbMATH OpenFDO

Authors Wenchang Luo, Guohui Lin

Publication date 15 December 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115642

zbMATH Keywords

approximation algorithmcontrollable schedulingjob rejectionmakespansingle-machine scheduling

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cites work

• A multi-objective approach to resource allocation in single machine scheduling
• A survey of results for sequencing problems with controllable processing times
• A survey of scheduling with controllable processing times
• A survey on offline scheduling with rejection
• An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
• Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
• Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
• Erratum to: ``A survey on offline scheduling with rejection
• scientific article; zbMATH DE number 4035555 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Improving the complexities of approximation algorithms for optimization problems
• In-house production and outsourcing under different discount schemes on the total outsourcing cost
• Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing
• Minimizing maximum delivery completion time for order scheduling with rejection
• Multiprocessor Scheduling with Rejection
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
• Single machine scheduling with release dates and rejection
• Single-machine scheduling with machine unavailability periods and resource dependent processing times
• Single-machine scheduling with resource-dependent processing times and multiple unavailability periods
• Techniques for scheduling with rejection

This page was built for publication: Single machine controllable scheduling with bounded makespan

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