Single machine lot scheduling to minimize maximum weighted completion time

DOI10.1007/S10878-025-01327-XMaRDI QIDQ6956312zbMATH OpenFDO

Authors Feifeng Zheng, Na Li, Ming Liu, Yinfeng Xu

Publication date 18 July 2025

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

Full work available at URL https://doi.org/10.1007/S10878-025-01327-X

zbMATH Keywords

lot schedulingmaximum weighted completion timemicro-productsorder-splittingsingle machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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 parallel-machine scheduling problem with an antithetical property to maximize total weighted early work
• Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time
• Competitive snoopy caching
• scientific article; zbMATH DE number 6490206 (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
• Minimization of maximum lateness on parallel machines with a single server and job release dates
• On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan
• Online NDP-constraint scheduling of jobs with delivery times or weights
• Online single-processor scheduling with an unexpected breakdown
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• 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 with rejection to minimize the weighted makespan
• Single-machine lot scheduling with variable lot processing times

Cited in

(1)

• Single-machine lot scheduling with order rejection

This page was built for publication: Single machine lot scheduling to minimize maximum weighted completion time

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