Order Preserving Allocation Of Jobs To Two Non-Identical Parallel Machines: A Solvable Case Of The Maximum Cut Problem (Q3208405)
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: Order Preserving Allocation Of Jobs To Two Non-Identical Parallel Machines: A Solvable Case Of The Maximum Cut Problem |
scientific article; zbMATH DE number 3650278
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Order Preserving Allocation Of Jobs To Two Non-Identical Parallel Machines: A Solvable Case Of The Maximum Cut Problem |
scientific article; zbMATH DE number 3650278 |
Statements
Order Preserving Allocation Of Jobs To Two Non-Identical Parallel Machines: A Solvable Case Of The Maximum Cut Problem (English)
0 references
1979
0 references
order preserving allocation of jobs
0 references
two non-identical parallel machines
0 references
maximum cut problem
0 references
minimization of mean flow time
0 references
algorithm
0 references
scheduling
0 references
