Minimizing the makespan for scheduling problems with general deterioration effects (Q460302): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
Summary: This paper investigates the scheduling problems with general deterioration models. By the deterioration models, the actual processing time functions of jobs depend not only on the scheduled position in the job sequence but also on the total weighted normal processing times of the jobs already processed. In this paper, the objective is to minimize the makespan. For the single-machine scheduling problems with general deterioration effects, we show that the considered problems are polynomially solvable. For the flow shop scheduling problems with general deterioration effects, we also show that the problems can be optimally solved in polynomial time under the proposed conditions. | |||
| Property / review text: Summary: This paper investigates the scheduling problems with general deterioration models. By the deterioration models, the actual processing time functions of jobs depend not only on the scheduled position in the job sequence but also on the total weighted normal processing times of the jobs already processed. In this paper, the objective is to minimize the makespan. For the single-machine scheduling problems with general deterioration effects, we show that the considered problems are polynomially solvable. For the flow shop scheduling problems with general deterioration effects, we also show that the problems can be optimally solved in polynomial time under the proposed conditions. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6354534 / rank | |||
Normal rank | |||
Revision as of 12:38, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the makespan for scheduling problems with general deterioration effects |
scientific article |
Statements
Minimizing the makespan for scheduling problems with general deterioration effects (English)
0 references
13 October 2014
0 references
Summary: This paper investigates the scheduling problems with general deterioration models. By the deterioration models, the actual processing time functions of jobs depend not only on the scheduled position in the job sequence but also on the total weighted normal processing times of the jobs already processed. In this paper, the objective is to minimize the makespan. For the single-machine scheduling problems with general deterioration effects, we show that the considered problems are polynomially solvable. For the flow shop scheduling problems with general deterioration effects, we also show that the problems can be optimally solved in polynomial time under the proposed conditions.
0 references
