A note on a single-machine lot scheduling problem with indivisible orders

DOI10.1016/J.COR.2016.10.004MaRDI QIDQ1652143zbMATH OpenOpenAlexFDO

Authors Dar-Li Yang, Yung-Tsung Hou, Wen-Hung Kuo

Publication date 11 July 2018

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2016.10.004

zbMATH Keywords

indivisible orderinteger programminglot schedulingsingle machinetotal completion time

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Lot scheduling on a single machine
• Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
• Lot-size scheduling of a single product on unrelated parallel machines
• scientific article; zbMATH DE number 3947982
• Scheduling multiple orders per job in a single machine to minimize total completion time

Cites work

• A polynomial algorithm for a one machine batching problem
• A survey of scheduling problems with setup times or costs
• Batch scheduling of identical jobs on parallel identical machines
• Batching in single operation manufacturing systems
• Batching to Minimize Flow Times on Parallel Heterogeneous Machines
• 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
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine
• Scheduling with batching: A review

Cited in

(13)

• Single machine lot scheduling to minimize the total weighted (discounted) completion time
• Single machine batch scheduling with two non-disjoint agents and splitable jobs
• Single machine lot scheduling with non-uniform lot capacities and processing times
• Lot scheduling on a single machine
• 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: A note on a single-machine lot scheduling problem with indivisible orders

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