scientific article; zbMATH DE number 1487903

MaRDI QIDQ4494435zbMATH OpenFDO

Authors Ulrich Dorndorf, Erwin Pesch, Toàn Phan-Huy

Publication date 5 February 2002

zbMATH Keywords

surveybranch-and-bound algorithmlocal searchtabu searchjob shopconsistency testresource constrained project scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Search theory (90B40) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Recommendations

• New perspectives in scheduling theory
• New challenges in scheduling theory
• New challenges in scheduling theory
• New challenges in scheduling theory
• Current trends in deterministic scheduling
• Recent advances for a classical scheduling problem
• scientific article; zbMATH DE number 4076943
• Special issue on Scheduling
• scientific article; zbMATH DE number 3989090
• Scheduling problems

Cited in

(8)

• Improving branch and bound for jobshop scheduling with constraint propagation
• scientific article; zbMATH DE number 5209067 (Why is no real title available?)
• Scheduling projects with labor constraints
• New trends in machine scheduling
• AN O(n^2 log^2 n) ALGORITHM FOR INPUT-OR-OUTPUT TEST IN DISJUNCTIVE SCHEDULING
• Current trends in deterministic scheduling
• Moving to higher directional scheduling schemes
• A local search framework for industrial test laboratory scheduling

This page was built for publication:

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