scientific article; zbMATH DE number 702559

zbMath0828.90059MaRDI QIDQ4315889

Marjan van den Akker

Publication date: 13 December 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

branch-and-cut algorithmsone-machine scheduling

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling jobs of equal length: Complexity, facets and computational results ⋮ A space-indexed formulation of packing boxes into a larger box ⋮ Exploiting Packing Components in General-Purpose Integer Programming Solvers ⋮ Scheduling projects with labor constraints ⋮ Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates ⋮ On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems ⋮ A time-dependent multiple criteria single-machine scheduling problem ⋮ Optimal solutions for a dock assignment problem with trailer transportation ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ MIP modelling of changeovers in production planning and scheduling problems