Open shop, satellite communication and a theorem by Egerváry (1931)

DOI10.1016/0167-6377(95)00043-7MaRDI QIDQ1919192zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mauro Dell'Amico, Silvano Martello

Publication date 11 February 1997

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(95)00043-7

zbMATH Keywords

matrix decompositionmultiple machineopen shopsatellite communicationschedulingsequencingtime slot assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication
• The Hungarian method for the assignment problem
• On the efficiency of Egerváry's perfect matching algorithm
• On Kuhn's Hungarian Method?A tribute from Hungary
• scientific article; zbMATH DE number 3193290

Cites work

• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• scientific article; zbMATH DE number 3095897 (Why is no real title available?)
• Open Shop Scheduling to Minimize Finish Time

Cited in

(5)

• New bounds for optimum traffic assignment in satellite communication.
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication
• Branch-cut-and-price for open-shop scheduling problems with any regular minsum objective

This page was built for publication: Open shop, satellite communication and a theorem by Egerváry (1931)

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