Q3313598 (Q3313598): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import recommendations run Q6767936
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Three-machine flow shop scheduling with overlapping waiting time constraints / rank
 
Normal rank
Property / Recommended article: Three-machine flow shop scheduling with overlapping waiting time constraints / qualifier
 
Similarity Score: 0.9126307
Amount0.9126307
Unit1
Property / Recommended article: Three-machine flow shop scheduling with overlapping waiting time constraints / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3072696 / rank
 
Normal rank
Property / Recommended article: Q3072696 / qualifier
 
Similarity Score: 0.9066037
Amount0.9066037
Unit1
Property / Recommended article: Q3072696 / qualifier
 
Property / Recommended article
 
Property / Recommended article: The Three-Machine No-Wait Flow Shop is NP-Complete / rank
 
Normal rank
Property / Recommended article: The Three-Machine No-Wait Flow Shop is NP-Complete / qualifier
 
Similarity Score: 0.8954214
Amount0.8954214
Unit1
Property / Recommended article: The Three-Machine No-Wait Flow Shop is NP-Complete / qualifier
 
Property / Recommended article
 
Property / Recommended article: Three-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times / rank
 
Normal rank
Property / Recommended article: Three-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times / qualifier
 
Similarity Score: 0.8944182
Amount0.8944182
Unit1
Property / Recommended article: Three-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3747218 / rank
 
Normal rank
Property / Recommended article: Q3747218 / qualifier
 
Similarity Score: 0.8912888
Amount0.8912888
Unit1
Property / Recommended article: Q3747218 / qualifier
 
Property / Recommended article
 
Property / Recommended article: The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times / rank
 
Normal rank
Property / Recommended article: The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times / qualifier
 
Similarity Score: 0.8881486
Amount0.8881486
Unit1
Property / Recommended article: The three-machine flowshop scheduling problem to minimise maximum lateness with separate setup times / qualifier
 
Property / Recommended article
 
Property / Recommended article: On three-machine flow shops with random job processing times / rank
 
Normal rank
Property / Recommended article: On three-machine flow shops with random job processing times / qualifier
 
Similarity Score: 0.88366747
Amount0.88366747
Unit1
Property / Recommended article: On three-machine flow shops with random job processing times / qualifier
 
Property / Recommended article
 
Property / Recommended article: No-wait flexible flowshop scheduling with no-idle machines / rank
 
Normal rank
Property / Recommended article: No-wait flexible flowshop scheduling with no-idle machines / qualifier
 
Similarity Score: 0.8794626
Amount0.8794626
Unit1
Property / Recommended article: No-wait flexible flowshop scheduling with no-idle machines / qualifier
 
Property / Recommended article
 
Property / Recommended article: A New Heuristic for Three-Machine Flow Shop Scheduling / rank
 
Normal rank
Property / Recommended article: A New Heuristic for Three-Machine Flow Shop Scheduling / qualifier
 
Similarity Score: 0.879403
Amount0.879403
Unit1
Property / Recommended article: A New Heuristic for Three-Machine Flow Shop Scheduling / qualifier
 

Latest revision as of 12:09, 4 April 2025

scientific article
Language Label Description Also known as
English
No label defined
scientific article

    Statements

    0 references
    1982
    0 references
    three machine minimum makespan permutation flowshop
    0 references
    NP-hardness
    0 references
    worst case behavior
    0 references
    no wait in process
    0 references
    solvable special cases
    0 references
    two surrogate machine heuristics
    0 references

    Identifiers