A note on minimum makespan assembly plans

DOI10.1016/S0377-2217(01)00295-8zbMATH Open1082.90524OpenAlexW2019071454MaRDI QIDQ1848367FDOQ1848367

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

Recommendations

• Assembly-line scheduling with concurrent operations and parallel machines
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• scientific article; zbMATH DE number 4072689
• scientific article; zbMATH DE number 4012297
• Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length

zbMATH Keywords

HeuristicsSchedulingManufacturingAssembling

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Minimizing task completion time with the execution set method
• Finding hypernetworks in directed hypergraphs
• Flow hypergraph reducibility
• Minimal functional routes in directed graphs with dependent edges

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

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