Minimizing total completion time in a two-machine flow shop with deteriorating jobs (Q850246): 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.amc.2005.11.162 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084374562 / rank | |||
Normal rank | |||
Revision as of 21:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing total completion time in a two-machine flow shop with deteriorating jobs |
scientific article |
Statements
Minimizing total completion time in a two-machine flow shop with deteriorating jobs (English)
0 references
15 November 2006
0 references
In the paper two-machine flow-shop scheduling problems with deteriorating jobs are studied where the processing time of a job is given by an increasing linear deterioration function depending on its starting time. The objective is to find a schedule minimizing the total completion time. At first, the authors study some polynomially solvable special cases of the problem and derive some dominance properties and two lower bounds. Afterwards, a heuristic and a branch-and-bound algorithm are proposed and compared in computational experiments.
0 references
scheduling
0 references
flow-shop
0 references
simple linear deterioration
0 references
total completion time
0 references
