Single-machine group scheduling problems with deterioration to minimize the sum of completion times (Q1954598): 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.1155/2012/275239 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2111661388 / rank | |||
Normal rank | |||
Revision as of 23:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single-machine group scheduling problems with deterioration to minimize the sum of completion times |
scientific article |
Statements
Single-machine group scheduling problems with deterioration to minimize the sum of completion times (English)
0 references
11 June 2013
0 references
Summary: We consider two single-machine group scheduling problems with deteriorating group setup and job processing times. That is, the job processing times and group setup times are linearly increasing (or decreasing) functions of their starting times. Jobs in each group have the same deteriorating rate. The objective of scheduling problems is to minimize the sum of completion times. We show that the sum of completion times minimization problems remains polynomially solvable under the agreeable conditions.
0 references
