Robust scheduling for minimizing maximum lateness on a serial-batch processing machine

DOI10.1016/j.ipl.2024.106473zbMATH Open1543.90114MaRDI QIDQ6551700

Liang Tang, Andrea Pizzuti, Wei Wu

Publication date: 7 June 2024

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

zbMATH Keywords

schedulingdynamic programmingrobust optimizationheuristic algorithmbatch scheduling

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36)

Cites Work

• Unnamed Item
• Batch sizing and job sequencing on a single machine
• Investigating the recoverable robust single machine scheduling problem under interval uncertainty
• The complexity of one-machine batching problems
• Time bounds for selection
• Scheduling with batching: A review
• A robust optimization approach for the multi-mode resource-constrained project scheduling problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• The Price of Robustness
• Scheduling Groups of Jobs on a Single Machine
• Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems
• Single machine robust scheduling with budgeted uncertainty

This page was built for publication: Robust scheduling for minimizing maximum lateness on a serial-batch processing machine