Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Bison / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-022-00750-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4296899820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energetic reasoning for energy-constrained scheduling with a continuous resource / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability tests and time-bound adjustments for cumulative scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks with chain constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Multiprocessor Tasks to Minimize Schedule Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling malleable tasks on parallel processors to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: The job shop scheduling problem: Conventional and new solution techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and related problems: general arc-flow formulation with graph compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for a bin packing problem with linear usage cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bin Packing Problem with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling for parallel processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks for mean flow time criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource constrained scheduling as generalized bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomiality for Bin Packing with a Constant Number of Item Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling semi-malleable jobs to minimize mean flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithmic Results for Bin Packing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for scheduling of projects with variable-intensity activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Vehicle Routing on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Task Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Procedures for the bin packing problem with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \texttt{Absalom}: balancing assembly lines with assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving RCPSP/max by lazy clause generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling fully parallel jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the total weighted completion time of fully parallel jobs with integer parallel units / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:26, 30 July 2024

scientific article
Language Label Description Also known as
English
Packing-based branch-and-bound for discrete malleable task scheduling
scientific article

    Statements

    Packing-based branch-and-bound for discrete malleable task scheduling (English)
    0 references
    0 references
    4 November 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    multiprocessor scheduling
    0 references
    malleable tasks
    0 references
    precedence constraints
    0 references
    bin packing
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references