Two-stage open shop scheduling with a bottleneck machine (Q1592745): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744042 / 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: Worst-case analysis of heuristics for open shops with parallel machines / 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: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the multiprocessor open shop scheduling problem / 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: An open shop scheduling problem with a non-bottleneck machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank

Latest revision as of 12:36, 3 June 2024

scientific article
Language Label Description Also known as
English
Two-stage open shop scheduling with a bottleneck machine
scientific article

    Statements

    Identifiers