On a scheduling problem where a job can be executed only by a limited number of processors

DOI10.1016/0305-0548(88)90063-9zbMath0646.90045OpenAlexW1966447954MaRDI QIDQ1104235

Ruay-Shiung Chang, Richard Chia-Tung Lee

Publication date: 1988

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(88)90063-9

zbMATH Keywords

makespanpolynomial time algorithmsjob schedulingoptimal assignmentbalanced solution

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling jobs to minimize total cost ⋮ Scheduling with constrained processor allocation for interval orders ⋮ The \(\beta\)-assignment problem in general graphs ⋮ Scheduling unit-time jobs on processors with different capabilities ⋮ UET-scheduling with chain-type precedence constraints ⋮ A new approximation algorithm for UET-scheduling with chain-type precedence constraints. ⋮ UET-scheduling with constrained processor allocations ⋮ Personnel placement in a fuzzy environment ⋮ Deterministic multiprocessor scheduling with multiple objectives ⋮ On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems ⋮ Scheduling multiprocessor tasks -- An overview ⋮ The \(\beta\)-assignment problems

Cites Work

• On the continuous working problem
• Parallel concepts in graph theory
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item