Process selection and sequencing in a two-agents production system

DOI10.1007/s10288-002-0007-xzbMath1069.90036OpenAlexW2004851758MaRDI QIDQ1432015

Alessandro Agnetis, Paolo Detti, Carlo 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

algorithmssequencingnetwork flowsoperations management

Mathematics Subject Classification ID

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

Related Items (2)

A lower bound on the Hamiltonian path completion number of a line graph ⋮ Local search algorithms for finding the Hamiltonian completion number of line graphs

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