Single machine scheduling with rejection to minimize the weighted makespan

DOI10.1007/978-3-030-93176-6_9zbMath1498.90092OpenAlexW4205908595MaRDI QIDQ2151365

Jinwen Ou, Li-Qi Zhang, Ling-Fa Lu

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93176-6_9

zbMATH Keywords

dynamic programmingFPTASscheduling with rejectionbinary NP-hardweighted makespan

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines

Cites Work

• A survey on offline scheduling with rejection
• New approximation algorithms for machine scheduling with rejection on single and parallel machine
• Minimizing maximum delivery completion time for order scheduling with rejection
• A survey of results for sequencing problems with controllable processing times
• Single machine scheduling with release dates and rejection
• A bicriterion approach to time/cost trade-offs in sequencing
• Preemptive scheduling with rejection
• On the parameterized tractability of single machine scheduling with rejection
• Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
• Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
• Flowshop scheduling with learning effect and job rejection
• A survey of scheduling with controllable processing times
• Scheduling with partial rejection
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time
• Multiprocessor Scheduling with Rejection
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Single machine scheduling with rejection to minimize the weighted makespan