A Constraint Programming Approach for Solving a Queueing Design and Control Problem

DOI10.1287/ijoc.1080.0307zbMath1243.90047OpenAlexW2124761764MaRDI QIDQ2899022

J. Christopher Beck, Daria Terekhov, Kenneth N. Brown

Publication date: 28 July 2012

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

Full work available at URL: https://doi.org/10.1287/ijoc.1080.0307

zbMATH Keywords

optimizationqueueshybrid algorithmsconstraint programming

Mathematics Subject Classification ID

Stochastic programming (90C15) Queues and service in operations research (90B22) Theory of organizations, manpower planning in operations research (90B70)

Related Items (6)

Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications ⋮ Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ Decomposition Methods for the Parallel Machine Scheduling Problem with Setups ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem ⋮ An extended queueing control model for facilities with front room and back room operations and mixed-skilled workers

This page was built for publication: A Constraint Programming Approach for Solving a Queueing Design and Control Problem