Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57440457 / 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: Worst-case analysis of heuristics for open shops with parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note On The Complexity Of Openshop Scheduling Problems / 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: Scheduling open shops with parallel machines / 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
Property / cites work
 
Property / cites work: A genetic algorithm for the proportionate multiprocessor open shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Focused Scheduling in Proportionate Flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212909 / 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: Modeling and analyzing a physician clinic environment using discrete-event (visual) simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank

Latest revision as of 05:17, 2 July 2024

scientific article
Language Label Description Also known as
English
Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
scientific article

    Statements

    Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (English)
    0 references
    0 references
    0 references
    17 November 2009
    0 references
    0 references
    scheduling
    0 references
    sequencing
    0 references
    deterministic
    0 references
    proportionate multiprocessor open shop
    0 references
    polynomial time algorithms
    0 references
    0 references
    0 references