A note on minimum makespan assembly plans

DOI10.1016/S0377-2217(01)00295-8zbMath1082.90524OpenAlexW2019071454MaRDI QIDQ1848367

Giorgio Gallo, Maria Grazia Scutellà

Publication date: 20 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00295-8

zbMATH Keywords

HeuristicsManufacturingSchedulingAssembling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Flow hypergraph reducibility ⋮ Minimal functional routes in directed graphs with dependent edges ⋮ Finding hypernetworks in directed hypergraphs

Cites Work

• Scheduling tree-structured tasks with restricted execution times
• Flows on hypergraphs
• Directed hypergraphs and applications
• `` Strong NP-Completeness Results
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: A note on minimum makespan assembly plans