Single-machine scheduling with production and rejection costs to minimize the maximum earliness

DOI10.1007/s10878-016-9992-0zbMath1383.90014OpenAlexW2236221321MaRDI QIDQ2410087

Li-Qi Zhang, Ling-Fa Lu

Publication date: 17 October 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-9992-0

zbMATH Keywords

schedulingrejection costproduction costmaximum earliness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Minimizing maximum delivery completion time for order scheduling with rejection, Single machine lot scheduling with optional job-rejection, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

Cites Work

• Unnamed Item
• A survey on offline scheduling with rejection
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Single-machine scheduling under the job rejection constraint
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Single machine scheduling with release dates and rejection
• Preemptive scheduling with rejection
• Two-machine flow-shop scheduling with rejection
• Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties
• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection
• Algorithms and Data Structures