MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server (Q1761182)
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: MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server |
scientific article; zbMATH DE number 6106603
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server |
scientific article; zbMATH DE number 6106603 |
Statements
MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server (English)
0 references
15 November 2012
0 references
scheduling
0 references
MIP
0 references
parallel machines
0 references
single server
0 references
0 references
0 references
0 references
0 references
0 references
