Single-machine group scheduling problems with variable job processing times (Q1666514)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Single-machine group scheduling problems with variable job processing times |
scientific article |
Statements
Single-machine group scheduling problems with variable job processing times (English)
0 references
27 August 2018
0 references
Summary: This paper considers two resource constrained single-machine group scheduling problems. These problems involve variable job processing times (general position-dependent learning effects and deteriorating jobs); that is, the processing time of a job is defined by the function that involves its starting time and position in the group, and groups' setup time is a positive strictly decreasing continuous function of the amount of consumed resource. Polynomial time algorithms are proposed to optimally solve the makespan minimization problem under the constraint that the total resource consumption does not exceed a given limit and the total resource consumption minimization problem under the constraint that the makespan does not exceed a given limit, respectively.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references