Flow shop scheduling
    flowchart
    AA["Associated Authors (0)"]
    C[Flow shop scheduling]
    BC["Broader Concepts (2)"]
    NC["Narrower Concepts (10)"]
    C== skos:broader ==>BC
    NC== skos:broader ==>C
    AA== dcterms:relation ==>C
    click BC "#broader-concepts"
    click NC "#narrower-concepts"
    click AA "#associated-authors"
    NI["add incoming edge"]
    NO["add outgoing edge"]
    NI-- ? -->C
    C-- ? -->NO
    click NI "#add-incoming-edge"
    click NO "#add-outgoing-edge"
    style NI stroke-width:2px,stroke-dasharray: 5 5
    style NO stroke-width:2px,stroke-dasharray: 5 5
- Wikidata
- https://www.wikidata.org/wiki/Q3074426
- OpenAlex ID
- https://openalex.org/C158336966 (API record)
- OpenAlex Description
- class of computational problem
- OpenAlex Level [?]
- 4
Broader Concepts
Narrower Concepts
- Deadline-monotonic scheduling
- Gang scheduling
- Genetic algorithm scheduling
- Job shop
- Least slack time scheduling
- Lottery scheduling
- Multiprocessor scheduling
- Nurse scheduling problem
- Open shop
- Open-shop scheduling
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.
 HelioWeb
 HelioWeb