Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage (Q2248262): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11766-013-3146-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114625142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with identical jobs and uniform parallel machines / 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: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage hybrid flowshop with uniform machines and setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of sequencing rules in static and dynamic hybrid flow systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on scheduling hybrid flow systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on makespan minimization in two-stage flexible flow shops with uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in hybrid flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hybrid flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the multiprocessor open shop scheduling problem / rank
 
Normal rank

Latest revision as of 16:37, 8 July 2024

scientific article
Language Label Description Also known as
English
Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
scientific article

    Statements

    Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2014
    0 references
    hybrid flow shop
    0 references
    open shop
    0 references
    heuristic algorithm
    0 references

    Identifiers