A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4744042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of two-machine open shops where jobs arrive over time / 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: Approximability of flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Maximum Lateness in a Two-Machine Open Shop / 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: Linear time approximation scheme for the multiprocessor open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank

Latest revision as of 14:51, 5 June 2024

scientific article
Language Label Description Also known as
English
A linear time approximation scheme for makespan minimization in an open shop with release dates
scientific article

    Statements