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

DOI10.1016/0167-6377(95)00043-7zbMath0855.90103OpenAlexW2034634884WikidataQ59222308 ScholiaQ59222308MaRDI QIDQ1919192

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

schedulingsequencingopen shopmatrix decompositionsatellite communicationtime slot assignmentmultiple machine

Mathematics Subject Classification ID

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

Related Items

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication, New bounds for optimum traffic assignment in satellite communication., Four decades of research on the open-shop scheduling problem to minimize the makespan

Cites Work

• Open Shop Scheduling to Minimize Finish Time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item