scientific article
From MaRDI portal
Publication:3802875
zbMath0655.90040MaRDI QIDQ3802875
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
manpower schedulingcyclic staffing problems with breakslinear time heuristicpolynomially solvable set-covering problems
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
A spreadsheet optimization system for library staff scheduling, Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms, Scheduling workforce relief breaks in advance versus in real-time, A binary-rounding heuristic for multi-period variable-task-duration assignment problems, A comparative evaluation of modeling approaches to the labor shift scheduling problem
