Games of Boldness, Where the Player Performing the Hardest Task Wins
From MaRDI portal
Publication:3990566
DOI10.1287/opre.40.1.76zbMath0813.90061OpenAlexW2139948123MaRDI QIDQ3990566
Hamilton Emmons, V. Reddy Dondeti
Publication date: 28 June 1992
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.40.1.76
Related Items (13)
An approximation algorithm for the license and shift class design problem ⋮ An analysis of shift class design problems ⋮ Optimal interval scheduling with a resource constraint ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Scheduling jobs within time windows on identical parallel machines: New model and algorithms ⋮ Exact and approximation algorithms for the operational fixed interval scheduling problem ⋮ On the computational complexity of (maximum) class scheduling ⋮ An exact approach for the personnel task rescheduling problem with task retiming ⋮ On the complexity of interval scheduling with a resource constraint ⋮ A greedy heuristic for shift minimization personnel task scheduling problem ⋮ Routing trains through railway stations: Complexity issues ⋮ Interval scheduling on identical machines ⋮ Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
This page was built for publication: Games of Boldness, Where the Player Performing the Hardest Task Wins
