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

DOI10.1007/BF01545591zbMath0885.90057MaRDI QIDQ1372768

Andreas Krämer

Publication date: 30 October 1997

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

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)

Related Items (1)

Resource-constrained project scheduling: Notation, classification, models, and methods

Cites Work

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

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