Single machine lot scheduling to minimize the total weighted (discounted) completion time

DOI10.1016/J.IPL.2018.10.002MaRDI QIDQ1628686zbMATH OpenOpenAlexFDO

Authors Y. Aharonov

Publication date 5 December 2018

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2018.10.002

zbMATH Keywords

lot schedulingsingle machineWSPT rule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single machine scheduling to minimize total weighted tardiness
• scientific article; zbMATH DE number 2219122
• Scheduling of a single machine to minimize total weighted completion time subject to release dates
• Single Machine Scheduling to Minimize Total Weighted Late Work
• Single machine scheduling problem with interval processing times to minimize mean weighted completion time
• Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
• A note on lot scheduling on a single machine to minimize maximum weighted tardiness
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• Fabrication scheduling on a single machine to minimize the weighted sum of product completion time

Cites work

• A note on a single-machine lot scheduling problem with indivisible orders
• A polynomial algorithm for a one machine batching problem
• Batching in single operation manufacturing systems
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• Lot scheduling on a single machine
• Minimizing flow-time on a single machine with integer batch sizes
• One-pass batching algorithms for the one-machine problem
• Single batch machine scheduling with deliveries
• Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval

Cited in

(18)

• A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
• Single machine batch scheduling with two non-disjoint agents and splitable jobs
• Single machine lot scheduling with optional job-rejection
• Single machine lot scheduling with non-uniform lot capacities and processing times
• Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
• A note on the single machine CON and CONW problems with lot scheduling
• Lot scheduling on a single machine
• scientific article; zbMATH DE number 2219122 (Why is no real title available?)
• Single-machine lot scheduling with variable lot processing times
• A note on lot scheduling on a single machine to minimize maximum weighted tardiness
• Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine
• Single machine lot scheduling with maintenance activity
• Lot scheduling on a single machine to minimize total weighted completion time
• Single machine lot scheduling to minimize maximum weighted completion time
• Mathematical models and optimal algorithms for lot scheduling considering job splitting and due dates in green logistics
• Single machine lot scheduling to minimize maximum weighted completion time
• Optimizing parallel batch scheduling on uniform machines: a focus on equal job durations with varied release dates and sizes
• Single-machine lot scheduling with order rejection

This page was built for publication: Single machine lot scheduling to minimize the total weighted (discounted) completion time

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