On the computational complexity of (maximum) shift class scheduling

DOI10.1016/0377-2217(93)90014-EMaRDI QIDQ684343zbMATH OpenOpenAlexFDO

Authors Antoon W. J. Kolen, Leo Kroon

Publication date 15 September 1993

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

Full work available at URL https://doi.org/10.1016/0377-2217(93)90014-e

zbMATH Keywords

aircraft maintenancefixed job scheduling problem

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) class scheduling
• On the complexity of manpower shift scheduling
• Complexity of a class of task scheduling problems
• Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
• On the optimality of approximation schemes for the classical scheduling problem
• On scheduling cycle shops: Classification, complexity and approximation
• On the optimality of exact and approximation algorithms for scheduling problems
• Algorithms for large scale shift minimisation personnel task scheduling problems
• scientific article; zbMATH DE number 4031379
• On the potentially optimal solutions of classical shop scheduling problems

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 52911 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An Optimal Solution for the Channel-Assignment Problem
• 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 ]
• On the computational complexity of (maximum) class scheduling
• Scheduling jobs with fixed start and end times
• When Is the Classroom Assignment Problem Hard?

Cited in

(7)

• Scheduling jobs within time windows on identical parallel machines: New model and algorithms
• Towards a robust scheduling on unrelated parallel machines: a scenarios based approach
• The optimal cost chromatic partition problem for trees and interval graphs
• Complete Complexity Classification of Short Shop Scheduling
• An analysis of shift class design problems
• License class design: Complexity and algorithms
• Routing trains through railway stations: Complexity issues

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

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