On the computational complexity of (maximum) class scheduling

DOI10.1016/0377-2217(91)90320-UMaRDI QIDQ1179005zbMATH OpenOpenAlexFDO

Authors Leo Kroon, Antoon W. J. Kolen

Publication date 26 June 1992

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(91)90320-u

zbMATH Keywords

aircraft maintenance processFixed Job Scheduling Problemnon- preemptive

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On the computational complexity of (maximum) shift class scheduling
• License class design: Complexity and algorithms
• An analysis of shift class design problems
• Exact and approximation algorithms for the operational fixed interval scheduling problem

Cites work

• An Optimal Solution for the Channel-Assignment Problem
• Dioïds and semirings: Links to fuzzy sets and other applications
• Games of Boldness, Where the Player Performing the Hardest Task Wins
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Max-min matching problems with multiple assignments
• Minimal Resources for Fixed and Variable Job Schedules
• On the complexity of computing the measure of ∪[a _i ,b _i ]
• Operations research
• Scheduling jobs with fixed start and end times
• When Is the Classroom Assignment Problem Hard?

Cited in

(22)

• License class design: Complexity and algorithms
• Routing trains through railway stations: Complexity issues
• Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
• Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
• An approximation algorithm for the license and shift class design problem
• An analysis of shift class design problems
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• Matching supply and demand in a sharing economy: classification, computational complexity, and application
• Interval scheduling on identical machines
• Working time constraints in operational fixed job scheduling
• A fixed job scheduling problem with machine-dependent job weights
• Increasing the revenue of self-storage warehouses by optimizing order scheduling
• Optimal interval scheduling with a resource constraint
• A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem
• On the complexity of interval scheduling with a resource constraint
• The optimal cost chromatic partition problem for trees and interval graphs
• A Lagrangian relaxation algorithm for stochastic fixed interval scheduling problem with non-identical machines and job classes
• On the computational complexity of (maximum) shift class scheduling
• Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• On the complexity of adjacent resource scheduling
• Methods to solve multi-skill project scheduling problem

This page was built for publication: On the computational complexity of (maximum) class scheduling

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