On the continuous working problem

DOI10.1016/0166-218X(90)90109-PzbMath0704.90047OpenAlexW2020692528MaRDI QIDQ917431

Ruay-Shiung Chang, Richard Chia-Tung Lee

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90109-p

zbMATH Keywords

NP-completeminimum makespancontinuous working problemmaximum working timeminimum resting time

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

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

Cites Work

• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Experiments With a Multipurpose, Theorem-Proving Heuristic Program
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the continuous working problem