On lower and upper bounds for single machine parallel batch scheduling

DOI10.1007/S11590-022-01857-XzbMath1505.90056OpenAlexW4212845939MaRDI QIDQ2091210

Alexandre Dolgui, Evgeny R. Gafarov

Publication date: 1 November 2022

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

Full work available at URL: https://doi.org/10.1007/s11590-022-01857-x

zbMATH Keywords

optimizationdynamic programmingbatch schedulingprecedence relations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Approximability results for the resource-constrained project scheduling problem with a single type of resources
• Scheduling a batching machine
• Scheduling one batch processor subject to job release dates
• Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time
• Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single machine parallel batch scheduling subject to precedence constraints

This page was built for publication: On lower and upper bounds for single machine parallel batch scheduling