scientific article; zbMATH DE number 3757696

MaRDI QIDQ3940840zbMATH OpenFDO

Authors Jacek Blazewicz

Publication date 1978

zbMATH Keywords

maximum latenessmean flow timeNP-completeparallel processorsschedule length

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25)

Cited in

(7)

• New trends in machine scheduling
• Simulated annealing for resource-constrained scheduling
• A linear time algorithm for restricted bin packing and scheduling problems
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods
• Scheduling: agreement graph vs resource constraints
• A log-linear (2 +5/6)-approximation algorithm for parallel machine scheduling with a single orthogonal resource
• Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem

This page was built for publication:

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