Packing-based branch-and-bound for discrete malleable task scheduling
type: Item
instance of: scholarly article
title: Packing-based branch-and-bound for discrete malleable task scheduling
zbMATH Open document ID: 1501.90024
author: R. Braune
published in: Journal of Scheduling
publication date: 2022-11-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7612468
zbMATH Keywords: multiprocessor scheduling
zbMATH Keywords: malleable tasks
zbMATH Keywords: precedence constraints
zbMATH Keywords: bin packing
zbMATH Keywords: branch-and-bound
describes a project that uses: Bison
MaRDI profile type: Publication
full work available at URL: s10951-022-00750-w
OpenAlex ID: W4296899820
cites work: Energetic reasoning for energy-constrained scheduling with a continuous resource
cites work: Satisfiability tests and time-bound adjustments for cumulative scheduling problems
cites work: Scheduling multiprocessor tasks with chain constraints
cites work: Scheduling Multiprocessor Tasks to Minimize Schedule Length
cites work: Scheduling malleable tasks on parallel processors to minimize the makespan
cites work: The job shop scheduling problem: Conventional and new solution techniques
cites work: Bin packing and related problems: general arc-flow formulation with graph compression
cites work: Lower bounds for a bin packing problem with linear usage cost
cites work: An Application of Bin-Packing to Multiprocessor Scheduling
cites work: The Bin Packing Problem with Precedence Constraints
cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms
cites work: Scheduling for parallel processing
cites work: Scheduling multiprocessor tasks for mean flow time criterion
cites work: Q3624058
cites work: Resource constrained scheduling as generalized bin packing
cites work: Polynomiality for Bin Packing with a Constant Number of Item Types
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Scheduling semi-malleable jobs to minimize mean flow time
cites work: New Algorithmic Results for Bin Packing and Scheduling
cites work: A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
cites work: Capacitated Vehicle Routing on Trees
cites work: Concurrent Task Systems
cites work: Q3993418
cites work: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
cites work: Procedures for the bin packing problem with precedence constraints
cites work: A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time
cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
cites work: \texttt{Absalom}: balancing assembly lines with assignment restrictions
cites work: Solving RCPSP/max by lazy clause generation
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: Scheduling fully parallel jobs
cites work: Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
DOI: 10.1007/S10951-022-00750-W
description: scientific article; zbMATH DE number 7612468