Job shop scheduling with unit length tasks (Q2905324): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: M. E. Akveld / rank
Normal rank
 
Property / author
 
Property / author: M. E. Akveld / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085269837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the job-shop problem with two jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5755525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity and Barely Random Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:08, 5 July 2024

scientific article
Language Label Description Also known as
English
Job shop scheduling with unit length tasks
scientific article

    Statements

    Job shop scheduling with unit length tasks (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    job shop scheduling
    0 references
    online algorithm
    0 references
    competitive analysis
    0 references
    0 references