A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs (Q632684)
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: A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs |
scientific article; zbMATH DE number 5870589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs |
scientific article; zbMATH DE number 5870589 |
Statements
A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs (English)
0 references
25 March 2011
0 references
scheduling
0 references
single machine scheduling
0 references
learning effect
0 references
deterioration jobs
0 references
release times
0 references
makespan
0 references
0 references
0 references
0 references
0 references
0 references
0.8621804714202881
0 references
0.8569969534873962
0 references
0.8561211228370667
0 references
0.8551483154296875
0 references
0.8538733124732971
0 references
