Scheduling jobs of equal length: Complexity, facets and computational results

DOI10.1007/3-540-59408-6_58zbMATH Open1500.90016OpenAlexW2169736978MaRDI QIDQ5101422

Frits C. R. Spieksma, Yves Cramer

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_58

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Throughput rate optimization in the automated assembly of printed circuit boards

Related Items (1)

Formulating a scheduling problem with almost identical jobs by using positional completion times

This page was built for publication: Scheduling jobs of equal length: Complexity, facets and computational results