Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine (Q3896830)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
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
