Network flow approaches to pre-emptive open-shop scheduling problems with time-windows (Q2503223): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.ejor.2005.01.062 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072152357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs to minimize total cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parametric maximum flow algorithm for bipartite graphs with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / 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: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Jobs on Several Machines with the Job Splitting Property / rank
 
Normal rank

Latest revision as of 20:21, 24 June 2024

scientific article
Language Label Description Also known as
English
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
scientific article

    Statements

    Network flow approaches to pre-emptive open-shop scheduling problems with time-windows (English)
    0 references
    0 references
    14 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling problem
    0 references
    network flow approach
    0 references
    pre-emptive open-shop
    0 references
    time-windows
    0 references
    Max-flow parametrical algorithm
    0 references
    0 references