Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (Q703281): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
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.1016/j.orl.2003.12.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037296416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of short schedules for uet bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3468865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling expressions on a pipelined processor with a maximal delay of one cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Scheduling with Pipelined Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling for two-processor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified shifting bottleneck procedure for job-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-white pebbles and graph separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Variants of the Bandwidth Minimization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling chains on a single machine with non-negative time lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Interval-Ordered Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-machine generalized precedence constrained scheduling problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:06, 7 June 2024

scientific article
Language Label Description Also known as
English
Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
scientific article

    Statements

    Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (English)
    0 references
    0 references
    11 January 2005
    0 references
    Sequencing
    0 references
    Precedence delays
    0 references
    Makespan
    0 references
    Computational complexity
    0 references

    Identifiers