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

DOI10.1007/BF01545591MaRDI QIDQ1372768zbMATH OpenFDO

Authors Andreas Krämer

Publication date 30 October 1997

Published in OR Spektrum (Search for Journal in Brave)

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

zbMATH Keywords

branch and boundmultiprocessor tasksprecedences

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(4)

• An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Packing-based branch-and-bound for discrete malleable task scheduling
• ILP formulations for scheduling ordered tasks on a bounded number of processors

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)