A binary search algorithm for the general coupled task scheduling problem (Q6057721): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Approximation algorithms for UET scheduling problems with exact delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for the coupled task problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of coupled tasks and one-machine no-wait robotic cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear lower bounds for the resource constrained project scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling coupled-operation jobs with exact time-lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>m</i>-Traveling Salesman Problem with Minmax Objective / 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: Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coupled task scheduling with exact delays: literature review and models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identical coupled task scheduling: polynomial complexity of the cyclic case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of coupled-task scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling coupled tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interleaving two-phased jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:45, 3 August 2024

scientific article; zbMATH DE number 7755407
Language Label Description Also known as
English
A binary search algorithm for the general coupled task scheduling problem
scientific article; zbMATH DE number 7755407

    Statements

    A binary search algorithm for the general coupled task scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    26 October 2023
    0 references
    0 references
    coupled task scheduling
    0 references
    single machine
    0 references
    minimizing makespan
    0 references
    binary search
    0 references
    heuristic
    0 references
    bounds
    0 references