scientific article; zbMATH DE number 7400718

zbMath1470.90037MaRDI QIDQ5152650

Martín Delafuente, Pablo Romero, Franco Robledo, Patricia Bevilacqua

Publication date: 24 September 2021

Full work available at URL: http://archives-web.univ-paris1.fr/rev-inv-ope/fileadmin/rev-inv-ope/files/37216/37216-06.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityMonte Carlo simulationmanpower optimization

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Queues and service in operations research (90B22) Theory of organizations, manpower planning in operations research (90B70)

Uses Software

• EXTRACOL

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristics for workforce planning with worker differences
• A graph coloring algorithm for large scale scheduling problems
• Coloring large graphs based on independent set extraction
• Workforce scheduling with multiple objectives
• A Proof for the Queuing Formula: L = λW
• A graph coloring algorithm for large scheduling problems
• Applied Probability and Queues
• A normal copula model for the arrival process in a call center
• Reducibility among Combinatorial Problems
• The complexity of theorem-proving procedures

This page was built for publication: