Open-shop dense schedules: properties and worst-case performance ratio (Q2434260): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/s10951-009-0128-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991396184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open-shop scheduling problems with dominated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \(\&\) bound algorithm for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Three-Machine Open Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good is a dense shop schedule? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the three-machine open shop with a bottleneck machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-stage open shop scheduling with a bottleneck machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Open-Shop Problem / 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: When difference in machine loads leads to efficient scheduling in open shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time open-shop problem with an arbitrary number of machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization in open shops: A polynomial time approximation scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:31, 7 July 2024

scientific article
Language Label Description Also known as
English
Open-shop dense schedules: properties and worst-case performance ratio
scientific article

    Statements

    Open-shop dense schedules: properties and worst-case performance ratio (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    open-shop
    0 references
    dense schedule
    0 references
    performance ratio
    0 references
    conjecture
    0 references
    0 references