Packing-based branch-and-bound for discrete malleable task scheduling
From MaRDI portal
Publication:2093190
DOI10.1007/S10951-022-00750-WzbMath1501.90024OpenAlexW4296899820MaRDI QIDQ2093190
Publication date: 4 November 2022
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-022-00750-w
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Procedures for the bin packing problem with precedence constraints
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
- Scheduling malleable tasks on parallel processors to minimize the makespan
- Scheduling semi-malleable jobs to minimize mean flow time
- Scheduling for parallel processing
- \texttt{Absalom}: balancing assembly lines with assignment restrictions
- Resource constrained scheduling as generalized bin packing
- The job shop scheduling problem: Conventional and new solution techniques
- Scheduling multiprocessor tasks with chain constraints
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Lower bounds for a bin packing problem with linear usage cost
- A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- Scheduling multiprocessor tasks for mean flow time criterion
- Scheduling fully parallel jobs
- Energetic reasoning for energy-constrained scheduling with a continuous resource
- Solving RCPSP/max by lazy clause generation
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Concurrent Task Systems
- Capacitated Vehicle Routing on Trees
- An Application of Bin-Packing to Multiprocessor Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Bin Packing Problem with Precedence Constraints
- New Algorithmic Results for Bin Packing and Scheduling
- Polynomiality for Bin Packing with a Constant Number of Item Types
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Packing-based branch-and-bound for discrete malleable task scheduling
