Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors
type: Item
instance of: scholarly article
title: Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors
zbMATH Open document ID: 0885.90057
DOI: 10.1007/BF01545591
author: Andreas Krämer
published in: OR Spektrum
publication date: 1997-10-30T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1081907
zbMATH Keywords: branch and bound
zbMATH Keywords: multiprocessor tasks
zbMATH Keywords: precedences
MaRDI profile type: Publication
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: Q3948568
cites work: Q3468865
cites work: Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
cites work: Scheduling preemptive multiprocessor tasks on dedicated processors
cites work: Nonpreemptive scheduling of independent tasks with prespecified processor allocations
cites work: Scheduling multiprocessor tasks on three dedicated processors
cites work: A branch and bound algorithm for the job-shop scheduling problem
cites work: Shop scheduling problems with multiprocessor tasks on dedicated processors
cites work: Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
cites work: The one-machine sequencing problem
cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem
cites work: Scheduling File Transfers
cites work: Q3328583
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Complexity of scheduling multiprocessor tasks with prespecified processors allocations
cites work: Q4872477
cites work: Q4739657
cites work: Multiprocessor scheduling with communication delays
Recommended article: Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs
Recommended article: A Branch-and-Bound Algorithm for Solving the Multiprocessor Scheduling Problem with Improved Lower Bounding Techniques
Recommended article: Q4427861
Recommended article: Parallel branch-and-bound methods for the job-shop scheduling problem
Recommended article: Multiprocessor scheduling with machine allotment and parallelism constraints
Recommended article: Q4011997
Recommended article: A parallel approximation scheme for the multiprocessor scheduling problem
Recommended article: Q3804433
Recommended article: An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines
description: scientific article; zbMATH DE number 1081907