Single-machine lot scheduling with order rejection

DOI10.1142/S0129054126400010MaRDI QIDQ7263313zbMATH OpenFDO

Authors Juan Zou, Xiaoxuan Cheng, Huiyi Ma, Yuzhong Zhang

Publication date 12 June 2026

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054126400010

zbMATH Keywords

approximation algorithmFPTASlot schedulingNP-hardorder rejection

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Cites work

• A note on a single-machine lot scheduling problem with indivisible orders
• A note on lot scheduling on a single machine to minimize maximum weighted tardiness
• A note on the single machine CON and CONW problems with lot scheduling
• A survey on offline scheduling with rejection
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Lot scheduling on a single machine
• Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
• Mathematical models and optimal algorithms for lot scheduling considering job splitting and due dates in green logistics
• Minimizing maximum delivery completion time for order scheduling with rejection
• New approximation algorithms for machine scheduling with rejection on single and parallel machine
• New results for scheduling to minimize tardiness on one machine with rejection and related problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel Machines Scheduling with Deteriorating Maintenance Activities and Job Rejection
• Parallel-machine scheduling with release dates and rejection
• Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost
• Single machine lot scheduling to minimize maximum weighted completion time
• Single machine lot scheduling to minimize the total weighted (discounted) completion time
• Single machine lot scheduling with non-uniform lot capacities and processing times
• Single machine lot scheduling with optional job-rejection
• Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
• Single machine scheduling with non-availability interval and optional job rejection
• Single-machine lot scheduling with variable lot processing times
• Single-machine scheduling with a deteriorating maintenance activity and DeJong's learning effect
• Single-machine scheduling with maintenance activities and rejection

This page was built for publication: Single-machine lot scheduling with order rejection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7263313)