Process selection and sequencing in a two-agents production system

DOI10.1007/S10288-002-0007-XMaRDI QIDQ1432015zbMATH OpenOpenAlexFDO

Authors Alessandro Agnetis, Paolo Detti, C. Meloni

Publication date 11 June 2004

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10288-002-0007-x

zbMATH Keywords

algorithmsnetwork flowssequencingoperations management

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Eulerian and Hamiltonian graphs (05C45) Production models (90B30)

Recommendations

• scientific article; zbMATH DE number 1786138
• Coordination of multiple agents for production management
• Coordination in a two-stage production system: complexity, conflict and cooperation
• A bi-objective coordination setup problem in a two-stage production system
• Agent-based scheduling in production systems

Cited in

(5)

• Local search algorithms for finding the Hamiltonian completion number of line graphs
• scientific article; zbMATH DE number 1852950 (Why is no real title available?)
• scientific article; zbMATH DE number 1786138 (Why is no real title available?)
• A lower bound on the Hamiltonian path completion number of a line graph
• Production optimization for agents of differing work rates

This page was built for publication: Process selection and sequencing in a two-agents production system

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