On the continuous working problem

DOI10.1016/0166-218X(90)90109-PMaRDI QIDQ917431zbMATH OpenOpenAlexFDO

Authors Ruay-Shiung Chang, R. C. T. 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

continuous working problemmaximum working timeminimum makespanminimum resting timeNP-complete

Mathematics Subject Classification ID

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

Recommendations

• The Fixed Job Schedule Problem with Working-Time Constraints
• Scheduling to Minimize Maximum Workload
• Discrete-continuous scheduling problems -- mean completion time results
• The Fixed Job Schedule Problem with Spread-Time Constraints
• On a methodology for discrete-continuous scheduling

Cites work

• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Experiments With a Multipurpose, Theorem-Proving Heuristic Program
• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 3754389 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(2)

• On a scheduling problem where a job can be executed only by a limited number of processors
• Scheduling jobs in a contaminated area: a model and heuristic algorithms

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

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