Minimal Resources for Fixed and Variable Job Schedules

From MaRDI portal
Publication:4147822

DOI10.1287/opre.26.1.68zbMath0371.90058OpenAlexW2029808296MaRDI QIDQ4147822

No author found.

Publication date: 1978

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.26.1.68




Related Items (22)

An approximation algorithm for the license and shift class design problemMaximizing the value of a space missionAn analysis of shift class design problemsOptimal interval scheduling with a resource constraintFixed interval scheduling: models, applications, computational complexity and algorithmsInverse interval scheduling via reduction on a single machineVehicles scheduling with sliding time windowsScheduling jobs within time windows on identical parallel machines: New model and algorithmsExact and approximation algorithms for the operational fixed interval scheduling problemDynamic fleet scheduling with uncertain demand and customer flexibilityBroadcasting revenue sharing after cancelling sports competitionsA dynamic programming based algorithm for the crew scheduling problem.Algorithms for large scale shift minimisation personnel task scheduling problemsOn the computational complexity of (maximum) class schedulingOn the computational complexity of (maximum) shift class schedulingLicense class design: Complexity and algorithmsOn the complexity of interval scheduling with a resource constraintStability and fairness in the job scheduling problemDynamic algorithms for multimachine interval scheduling through analysis of idle intervalsA graph colouring model for assigning a heterogeneous workforce to a given scheduleRouting trains through railway stations: Complexity issuesAlgorithms for preemptive scheduling of different classes of processors to do jobs with fixed times




This page was built for publication: Minimal Resources for Fixed and Variable Job Schedules