Machine scheduling with job rejection and Dejong's learning effect

DOI10.3934/mfc.2022024zbMath1530.90038OpenAlexW4285183885MaRDI QIDQ6112831

No author found.

Publication date: 7 August 2023

Published in: Mathematical Foundations of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/mfc.2022024

zbMATH Keywords

makespantotal completion timeFPTASrejectionDejong's learning effect

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Parallel-machine scheduling with release dates and rejection
• A survey on offline scheduling with rejection
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
• New approximation algorithms for machine scheduling with rejection on single and parallel machine
• Single-machine scheduling with learning considerations
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• New results for scheduling to minimize tardiness on one machine with rejection and related problems
• Flowshop scheduling with learning effect and job rejection
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection
• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
• Scheduling with Rejection and a Deteriorating Maintenance Activity on a Single Machine
• A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint
• Proportionate Flow Shop Scheduling with Rejection
• Single machine scheduling with learning effect considerations

This page was built for publication: Machine scheduling with job rejection and Dejong's learning effect