On the computational complexity of (maximum) shift class scheduling

Publisher Website

1 January 1993

journal article
Published by Elsevier in European Journal of Operational Research

Vol. 64 (1) , 138-151
https://doi.org/10.1016/0377-2217(93)90014-e

Abstract

No abstract available

Keywords

This publication has 6 references indexed in Scilit:

On the computational complexity of (maximum) class scheduling
European Journal of Operational Research, 1991
Scheduling jobs with fixed start and end times
Discrete Applied Mathematics, 1987
An Optimal Solution for the Channel-Assignment Problem
IEEE Transactions on Computers, 1979
On the complexity of computing the measure of ∪[a _i ,b _i ]
Communications of the ACM, 1978
Minimal Resources for Fixed and Variable Job Schedules
Operations Research, 1978
Minimizing the number of tankers to meet a fixed schedule
Naval Research Logistics Quarterly, 1954