An existence theorem for packing problems with implications for the computation of optimal machine schedules
From MaRDI portal
Publication:4327946
DOI10.1080/02331939208843823zbMath0817.90036OpenAlexW1970337322MaRDI QIDQ4327946
Publication date: 27 March 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939208843823
Deterministic scheduling theory in operations research (90B35) Combinatorial aspects of packing and covering (05B40)
Related Items
The job-shop problem and immediate selection ⋮ Bounds and initial solutions for frame ineration in machine scheduling ⋮ Improving earliest starting times in machine scine scheduling problem ⋮ Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem ⋮ Constraint propagation techniques for the disjunctive scheduling problem
Cites Work
