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

DOI10.1007/3-540-59408-6_58MaRDI QIDQ5101422zbMATH OpenOpenAlexFDO

Authors Frits C. R. Spieksma, Yves Crama

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)

Recommendations

• Scheduling jobs of equal length: Complexity, facets and computational results
• Scheduling equal processing time jobs to minimize the weighted number of late jobs
• Scheduling equal-length jobs on identical parallel machines
• Scheduling groups of unit length jobs on two identical parallel machines.
• Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan

Cites work

• scientific article; zbMATH DE number 3095897 (Why is no real title available?)
• Throughput rate optimization in the automated assembly of printed circuit boards

Cited in

(5)

• Scheduling jobs of equal length: Complexity, facets and computational results
• scientific article; zbMATH DE number 4170623 (Why is no real title available?)
• On the facial structure of scheduling polyhedra
• Formulating a scheduling problem with almost identical jobs by using positional completion times
• Time-of-use scheduling problem with equal-length jobs

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

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