Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine (Q3896830)

From MaRDI portal
Revision as of 23:03, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
scientific article

    Statements

    Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine (English)
    0 references
    1980
    0 references
    0 references
    job sequence
    0 references
    processing times
    0 references
    weighted flow cost
    0 references
    job-processing cost
    0 references
    single machine sequencing problem
    0 references
    optimal job sequence
    0 references
    heuristic algorithm
    0 references
    cost minimization
    0 references
    performance analysis
    0 references
    0 references
    0 references