On 3x<i>n</i>sequencing problem involving equivalent-job for a job-block with transportation-times of jobs (Q3661301)
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: On 3xnsequencing problem involving equivalent-job for a job-block with transportation-times of jobs |
scientific article; zbMATH DE number 3813336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On 3x<i>n</i>sequencing problem involving equivalent-job for a job-block with transportation-times of jobs |
scientific article; zbMATH DE number 3813336 |
Statements
On 3x<i>n</i>sequencing problem involving equivalent-job for a job-block with transportation-times of jobs (English)
0 references
1981
0 references
transformation time for a job
0 references
nx3 flow-shop scheduling
0 references
minimization of total elapsed time
0 references
equivalent-job for a job-block
0 references
algorithm
0 references
