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

DOI10.1007/BF02592090zbMath0853.90067MaRDI QIDQ1919094

Frits C. R. Spieksma, Yves Cramer

Publication date: 1 August 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

single machinepolyhedral descriptioncutting plane algorithmautomated assembly of printed circuit boards

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Runway sequencing with holding patterns ⋮ A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems ⋮ Optimal solutions for a dock assignment problem with trailer transportation ⋮ Scheduling two chains of unit jobs on one machine: A polyhedral study

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• Throughput rate optimization in the automated assembly of printed circuit boards
• A time indexed formulation of non-preemptive single machine scheduling problems
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• Some Facets for an Assignment Problem with Side Constraints
• Component Fixture Positioning/Sequencing for Printed Circuit Board Assembly with Concurrent Operations

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