Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints (Q2576249): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q439606
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Irina N. Lushchakova / 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.1016/j.ejor.2004.08.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016562180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop problems with unit time operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for single-machine problems with positive finish-start time-lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs / 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: Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates / rank
 
Normal rank

Latest revision as of 13:27, 11 June 2024

scientific article
Language Label Description Also known as
English
Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
scientific article

    Statements

    Identifiers