Rescheduling on identical parallel machines with machine disruptions to minimize total completion time (Q322965)
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: Rescheduling on identical parallel machines with machine disruptions to minimize total completion time |
scientific article; zbMATH DE number 6636256
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rescheduling on identical parallel machines with machine disruptions to minimize total completion time |
scientific article; zbMATH DE number 6636256 |
Statements
Rescheduling on identical parallel machines with machine disruptions to minimize total completion time (English)
0 references
7 October 2016
0 references
combinatorial optimization
0 references
production
0 references
rescheduling
0 references
bicriterion analysis
0 references
two-dimensional fully polynomial-time approximation scheme
0 references
0 references
0 references
0.8616611957550049
0 references
0.8527284264564514
0 references
0.8432139158248901
0 references
0.8281790614128113
0 references
