scientific article; zbMATH DE number 1555983

MaRDI QIDQ4525756zbMATH OpenFDO

Authors Hoong Chuin Lau

Publication date 24 January 2001

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING
• On the complexity of manpower shift scheduling
• A Modular Approach to Optimal Multiple-Shift Manpower Scheduling
• A class of manpower scheduling problems
• scientific article; zbMATH DE number 978509

Cited in

(7)

• On the complexity of manpower shift scheduling
• The venue management problem: setting staffing levels, shifts and shift schedules at concession stands
• Scheduling with few changes
• Multiple Shift Workforce Lower Bounds
• A Modular Approach to Optimal Multiple-Shift Manpower Scheduling
• COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING
• Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms

This page was built for publication:

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