A note on a single-shift days-off scheduling problem with sequence-dependent labor costs

DOI10.1007/s10951-022-00749-3zbMath1518.90031OpenAlexW4303195680MaRDI QIDQ6173709

Kevin Alexander Sánchez Galeano, Eiji Mizutani

Publication date: 13 July 2023

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-022-00749-3

zbMATH Keywords

dynamic programmingtraveling salesperson problem (TSP)days-off scheduling problemsequence- dependent labor costs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• A survey of school timetabling research
• A dynamic programming algorithm for days-off scheduling with sequence dependent labor costs
• Cyclic and non-cyclic scheduling of 12h shift nurses by network programming
• Single-shift off-day scheduling of a hierarchical workforce with variable demands
• A subproblem-centric model and approach to the nurse scheduling problem
• Staff scheduling and rostering: a review of applications, methods and models.
• On the complexity of manpower shift scheduling
• Personnel scheduling: a literature review
• The state of the art of nurse rostering
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• On Manpower Scheduling Algorithms
• Manpower Scheduling With Variable Demands And Alternate Weekends Off
• The Routing Problem with “K” Specified Nodes
• An Appraisal of Some Shortest-Path Algorithms
• An Algorithm For Multiple Shift Scheduling of Hierarchical Workforce On Four-Day Or Three-Day Workweeks
• Compressed Workweek Scheduling With Days Off Consecutivity, Weekend Off Frequency, And Work Stretch Constraints
• On using dynamic programming for time warping in pattern recognition

This page was built for publication: A note on a single-shift days-off scheduling problem with sequence-dependent labor costs