The three-machine proportionate open shop and mixed shop minimum makespan problems (Q319016): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2014.11.037 / rank
Normal rank
 
Property / author
 
Property / author: Christos P. Koulamas / rank
 
Normal rank
Property / author
 
Property / author: Kyparisis, George J. / rank
 
Normal rank
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.1016/j.ejor.2014.11.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073967547 / 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: Q4859840 / 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: On <i>J</i> -maximal and <i>J</i> -minimal Flow-Shop Schedules / 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: Q4248926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop scheduling with maximal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling ordered open shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonstrict vector summation in multi-operation scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252045 / 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: Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling two jobs with fixed and nonfixed routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shop-scheduling problems with fixed and non-fixed machine orders of the jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of mixed shop scheduling problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Machine Super-Shop Scheduling Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2014.11.037 / rank
 
Normal rank

Latest revision as of 14:17, 9 December 2024

scientific article
Language Label Description Also known as
English
The three-machine proportionate open shop and mixed shop minimum makespan problems
scientific article

    Statements

    The three-machine proportionate open shop and mixed shop minimum makespan problems (English)
    0 references
    6 October 2016
    0 references
    scheduling
    0 references
    open shop
    0 references
    mixed shop
    0 references

    Identifiers