Scheduling unit time open shops to minimize the weighted number of late jobs (Q1318657)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 540811
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling unit time open shops to minimize the weighted number of late jobs |
scientific article; zbMATH DE number 540811 |
Statements
Scheduling unit time open shops to minimize the weighted number of late jobs (English)
0 references
6 April 1994
0 references
unit processing times
0 references
polynomial algorithm
0 references
open shop
0 references
fixed number of machines
0 references
weighted number of late jobs
0 references
0.923912525177002
0 references
0.8984647393226624
0 references
0.8968333601951599
0 references
0.8968333601951599
0 references
0.8748483657836914
0 references
