Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors

DOI10.1007/BF01545591zbMATH Open0885.90057MaRDI QIDQ1372768FDOQ1372768

Authors: Andreas Krämer 

Publication date: 30 October 1997

Published in: OR Spektrum (Search for Journal in Brave)

Recommendations

• Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs
• A Branch-and-Bound Algorithm for Solving the Multiprocessor Scheduling Problem with Improved Lower Bounding Techniques
• scientific article; zbMATH DE number 1979517
• Parallel branch-and-bound methods for the job-shop scheduling problem
• Multiprocessor scheduling with machine allotment and parallelism constraints
• scientific article; zbMATH DE number 67289
• A parallel approximation scheme for the multiprocessor scheduling problem
• scientific article; zbMATH DE number 4072695
• An exact branch-and-price algorithm for multitasking scheduling on unrelated parallel machines

zbMATH Keywords

branch and boundmultiprocessor tasksprecedences

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Title not available (Why is that?)
• Scheduling File Transfers
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• Multiprocessor scheduling with communication delays
• The one-machine sequencing problem
• A branch and bound algorithm for the job-shop scheduling problem
• Title not available (Why is that?)
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Scheduling multiprocessor tasks on three dedicated processors
• Shop scheduling problems with multiprocessor tasks on dedicated processors
• Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
• Scheduling preemptive multiprocessor tasks on dedicated processors
• Title not available (Why is that?)

Cited In (3)

• ILP formulations for scheduling ordered tasks on a bounded number of processors
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Packing-based branch-and-bound for discrete malleable task scheduling

This page was built for publication: Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors

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