Minimizing mean flow time with parallel processors and resource constraints

DOI10.1007/BF00263292zbMath0606.68030OpenAlexW2049024694WikidataQ57387919 ScholiaQ57387919MaRDI QIDQ1084859

H. Röck, Wiesław X. Kubiak, Jacek Błażewicz, Jayme Luiz Szwarcfiter

Publication date: 1987

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00263292

zbMATH Keywords

NP-hardparallel processorsmultiprocessor systemspolynomial-time algorithmsadditional resourcesnonpreemptive scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (10)

Algorithms for the unrelated parallel machine scheduling problem with a resource constraint ⋮ Improved optimal algorithms for scheduling unit-length independent tasks on uniform machines ⋮ Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints. ⋮ Restricted assignment scheduling with resource constraints ⋮ Minimizing the makespan on two identical parallel machines with mold constraints ⋮ Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources ⋮ Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem ⋮ Algorithms for minimizing maximum lateness with unit length tasks and resource constraints ⋮ Production, maintenance and resource scheduling: a review ⋮ Parallel machine scheduling with additional resources: notation, classification, models and solution methods

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling of project networks
• Scheduling subject to resource constraints: Classification and complexity
• Scheduling tasks on two processors with deadlines and additional resources
• Deadline scheduling of tasks with ready times and resource constraints
• A linear time algorithm for restricted bin packing and scheduling problems
• Scheduling with Deadlines and Loss Functions
• Some new results in flow shop scheduling
• Preemptive Scheduling, Linear Programming and Network Flows
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The NP-completeness column: An ongoing guide
• Scheduling independent tasks to reduce mean finishing time

This page was built for publication: Minimizing mean flow time with parallel processors and resource constraints