Approximation scheme for single-machine rescheduling with job delay and rejection (Q6167004): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-031-16081-3_4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4296168269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchup Scheduling with Multiple Resources, Release Dates and Disruptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling for Job Unavailability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for designing EPTAS for load balancing on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalty cost constrained identical parallel machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector scheduling with rejection on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling for machine disruption to minimize makespan and maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost allocation in rescheduling with machine unavailable period / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling due to machine disruption to minimize the total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rescheduling on identical parallel machines with machine disruptions to minimize total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5153451 / rank
 
Normal rank

Latest revision as of 16:17, 1 August 2024

scientific article; zbMATH DE number 7708513
Language Label Description Also known as
English
Approximation scheme for single-machine rescheduling with job delay and rejection
scientific article; zbMATH DE number 7708513

    Statements

    Approximation scheme for single-machine rescheduling with job delay and rejection (English)
    0 references
    0 references
    0 references
    7 July 2023
    0 references
    rescheduling
    0 references
    rejection
    0 references
    dynamic programming
    0 references
    fully polynomial-time approximation scheme
    0 references

    Identifiers