A three-agent scheduling problem for minimizing the flow time on two machines

DOI10.1051/RO/2019088zbMath1443.90247OpenAlexW2973101650MaRDI QIDQ5109775

Wen-Chiung Lee, Jen-Ya Wang

Publication date: 13 May 2020

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2019088

zbMATH Keywords

branch-and-bound algorithmgenetic algorithmmulti-agent schedulingmaintenance schedulingsolution quality

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

A makespan minimization problem for versatile developers in the game industry

This page was built for publication: A three-agent scheduling problem for minimizing the flow time on two machines