Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times

DOI10.1016/0377-2217(93)90243-GzbMath0782.90050MaRDI QIDQ1310017

V. Reddy Dondeti, Hamilton Emmons

Publication date: 20 December 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)90243-g

zbMATH Keywords

polynomial-time algorithms; cyclic scheduling; \(NP\)-completeness; fixed start and finish times; minimal-cost preemptive solutions; preemption of jobs; transportation-network problem

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

Related Items

Routing trains through railway stations: Complexity issues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling jobs with fixed start and end times
• On the computational complexity of (maximum) class scheduling
• Max-min matching problems with multiple assignments
• An Optimal Solution for the Channel-Assignment Problem
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• The Complexity of Coloring Circular Arcs and Chords
• When Is the Classroom Assignment Problem Hard?
• Games of Boldness, Where the Player Performing the Hardest Task Wins
• Coloring a Family of Circular Arcs
• Minimal Resources for Fixed and Variable Job Schedules