Scheduling two-machine no-wait open shops to minimize makespan (Q707009): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ming-Chih Chen / rank
Normal rank
 
Property / author
 
Property / author: Ming-Chih Chen / 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.cor.2003.09.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990517659 / 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: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-wait shop scheduling: Computational complexity and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Machine No-Wait Flow Shop is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Flow-Shop Sequencing Problem with No Wait in Process<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Flowshop-Scheduling Problem with No Intermediate Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristics for no-wait flowshops to minimize makespan. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling for two-processor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Execution Time Shop Problems / 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: Complexity of Scheduling Shops with No Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4239706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Assignment and Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:59, 7 June 2024

scientific article
Language Label Description Also known as
English
Scheduling two-machine no-wait open shops to minimize makespan
scientific article

    Statements

    Scheduling two-machine no-wait open shops to minimize makespan (English)
    0 references
    0 references
    0 references
    0 references
    9 February 2005
    0 references
    Scheduling
    0 references
    No-wait
    0 references
    Open shop
    0 references
    Branch-and-bound
    0 references
    Heuristic
    0 references

    Identifiers