2020
DOI: 10.1155/2020/5161872
|View full text |Cite
|
Sign up to set email alerts
|

Group Scheduling Problems with Time-Dependent and Position-Dependent DeJong’s Learning Effect

Abstract: In this paper, we introduce a group scheduling model with time-dependent and position-dependent DeJong's learning effect. e objectives of scheduling problems are to minimize makespan, the total completion time, and the total weighted completion time, respectively. We show that the problems remain solvable in polynomial time under the proposed model.Example 2. As seen in Example 1, we change the objective to the total completion time minimization. By Algorithm 2, we solve the problem as follows:Step 1: In group… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 27 publications
(30 reference statements)
0
3
0
Order By: Relevance
“…The group order was related to the objective functions. Sun et al [18] considered a single-machine scheduling problem. A learning effect similar to DeJong's learning effect was based on the sum of previous processing times and positions.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The group order was related to the objective functions. Sun et al [18] considered a single-machine scheduling problem. A learning effect similar to DeJong's learning effect was based on the sum of previous processing times and positions.…”
Section: Literature Reviewmentioning
confidence: 99%
“…There are a few models that take into account that job processing times may be affected simultaneously by factors of different kind. For example, a number of models in which time-dependent job deterioration and DeJong's learning effect are mixed were analyzed by Zhang et al (2018) and Sun et al (2020). We refer the reader to Agnetis et al (2014), Strusevich and Rustogi (2017), Azzouz et al (2017), andGawiejnowicz (2020) for more details on different scheduling models of the kind discussed in this section.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Yang and Chand [31] constructed three basic models: there is no forgetting, partial forgetting, and total forgetting in job processing, and the processing time of jobs is related to the location. e authors in [32][33][34][35] continue to study this problem and obtain many important results.…”
Section: Introductionmentioning
confidence: 99%