Bounds and initial solutions for frame ineration in machine scheduling

DOI10.1080/02331939408843927zbMath0819.90043OpenAlexW2062557946MaRDI QIDQ3835646

Petra Helbig, Günter Deweß, E. Knobloch

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408843927

zbMATH Keywords

simulationbranch-and-boundjob-shop schedulingprecedence relationsminimal makespanframe iterationopen-shop problemstime frames

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Improving earliest starting times in machine scine scheduling problem
• An existence theorem for packing problems with implications for the computation of optimal machine schedules
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm

This page was built for publication: Bounds and initial solutions for frame ineration in machine scheduling