A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs (Q632684): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2010.12.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054771140 / rank | |||
Normal rank | |||
Revision as of 01:32, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 |
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
