Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine (Q3896830): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.28.5.1155 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086679490 / rank | |||
Normal rank | |||
Latest revision as of 23:03, 19 March 2024
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
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
