A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. (Q1410327): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4230896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for scheduling in a flow shop with multiple processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Order for Servers in Series with No Queue Capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal assignment of servers in a two stations tandem queue with no intermediate waiting room / 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: Optimal flowshop schedules with no intermediate storage space / 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: Flowshop sequencing problems with limited buffer storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: The permutation flow shop with buffers: A tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / 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: Q4051864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global lower bounds for flow shops with multiple processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of scheduling algorithms for no-wait flowshops with parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some no-wait shops scheduling problems: Complexity aspect / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptable Scheduling Algorithm for Flexible Flow Lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264751 / rank
 
Normal rank

Latest revision as of 11:44, 6 June 2024

scientific article
Language Label Description Also known as
English
A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
scientific article

    Statements

    A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. (English)
    0 references
    0 references
    0 references
    14 October 2003
    0 references
    0 references
    Scheduling
    0 references
    Heuristics
    0 references
    Makespan
    0 references
    Flow shop
    0 references
    Multiple processors
    0 references