Single machine batch scheduling with non-increasing time slot costs

DOI10.1007/s11590-021-01805-1zbMath1493.90068OpenAlexW3204611586MaRDI QIDQ2673533

Junfeng Ren

Publication date: 10 June 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01805-1

zbMATH Keywords

batchschedulingpolynomial-time algorithmtime slot cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Batch sizing and job sequencing on a single machine
• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Batch scheduling to minimize maximum lateness
• On scheduling with non-increasing time slot cost to minimize total weighted completion time
• Scheduling with batching: A review
• Calibration scheduling with time slot cost
• Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing
• A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities
• A survey of scheduling problems with setup times or costs
• Minimizing flow-time on a single machine with integer batch sizes
• Optimal Algorithms and a PTAS for Cost-Aware Scheduling
• Scheduling Groups of Jobs on a Single Machine
• Scheduling with variable time slot costs

This page was built for publication: Single machine batch scheduling with non-increasing time slot costs