The continuous time-resource trade-off scheduling problem with time windows

DOI10.1287/IJOC.2022.0142MaRDI QIDQ7036287zbMATH OpenFDO

Authors Christian Artigues, Emmanuel Hebrard, Alain Quilliot, Hélène Toussaint

Publication date 28 January 2025

Published in INFORMS Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

complexitytime windowsbranch-and-cutmixed integer linear programmingevacuation planninginsertion heuristiccontinuous time-resource trade-off scheduling

Mathematics Subject Classification ID

Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

This page was built for publication: The continuous time-resource trade-off scheduling problem with time windows

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