Approximation scheme for single-machine rescheduling with job delay and rejection

DOI10.1007/978-3-031-16081-3_4zbMath1526.90018OpenAlexW4296168269MaRDI QIDQ6167004

Xiaofei Liu, Ruiqing Sun

Publication date: 7 July 2023

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-16081-3_4

zbMATH Keywords

dynamic programmingrejectionreschedulingfully polynomial-time approximation scheme

Mathematics Subject Classification ID

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

Cites Work

• Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
• Rescheduling for machine disruption to minimize makespan and maximum lateness
• Penalty cost constrained identical parallel machine scheduling problem
• Approximation schemes for scheduling on parallel machines
• Vector scheduling with rejection on a single machine
• Cost allocation in rescheduling with machine unavailable period
• Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1
• Rescheduling due to machine disruption to minimize the total weighted completion time
• A unified framework for designing EPTAS for load balancing on parallel machines
• Rescheduling for Job Unavailability
• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Unnamed Item

This page was built for publication: Approximation scheme for single-machine rescheduling with job delay and rejection