Approximation algorithms for some discrete-continuous scheduling problems

MaRDI QIDQ1332457zbMATH OpenFDO

Authors Joanna Józefowska, Jan Węglarz

Publication date 29 August 1994

Published in Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)

zbMATH Keywords

discrete-continuous scheduling problems

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Resource level minimization in the discrete-continuous scheduling
• Discrete-continuous scheduling problems -- mean completion time results
• On a methodology for discrete-continuous scheduling
• Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
• scientific article; zbMATH DE number 955199

Cited in

(8)

• An experimental study of LP-based approximation algorithms for scheduling problems
• scientific article; zbMATH DE number 7267489 (Why is no real title available?)
• Theory and Applications of Models of Computation
• On the complexity of scheduling tasks with discrete starting times
• scientific article; zbMATH DE number 850325 (Why is no real title available?)
• scientific article; zbMATH DE number 444983 (Why is no real title available?)
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• Discrete-continuous scheduling problems -- mean completion time results

This page was built for publication: Approximation algorithms for some discrete-continuous scheduling problems

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