2010
DOI: 10.1016/j.ipl.2010.04.015
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling with job-dependent learning effects and multiple rate-modifying activities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 61 publications
(20 citation statements)
references
References 25 publications
(29 reference statements)
0
20
0
Order By: Relevance
“…Now, we discuss a further extension in which multiple DRMAs are allowed. Following Ji and Cheng [33] We analyze the 1|MT, DE, MDRMA| max problem first. The objective function can be expressed as…”
Section: Extensionmentioning
confidence: 99%
See 1 more Smart Citation
“…Now, we discuss a further extension in which multiple DRMAs are allowed. Following Ji and Cheng [33] We analyze the 1|MT, DE, MDRMA| max problem first. The objective function can be expressed as…”
Section: Extensionmentioning
confidence: 99%
“…The work then was extended in two aspects. Most focused on the machine perspective (e.g., [31][32][33][34][35][36]). However, some work focused on the human behavior perspective (e.g., [17,37,38]).…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, an RMP can also be associated with replacing a human operator by another one, so that all learning advantages of the previous employee are lost, and the overall productivity of the system decreases. Another form of RMP which is studied by [26], can be of the form in which the learning rate of a machine is further enhanced after an RMP.…”
Section: Model Descriptionmentioning
confidence: 99%
“…In fact, given the allocation to the first m − 1 machines, the remaining number of jobs assigned to machine m is completely determined. Hence, this upper bound can be slightly reduced to O (n m−1 ); see Ji 1 9 16 23 135 9 16 23 39 2 4 13 27 99 4 13 27 22 3 3 13 28 87 3 13 28 26 4 10 16 24 120 10 16 24 32 5 9 18 30 178 9 18 30 11 6 3 13 24 319 3 13 24 16 7 6 20 21 240 6 20 21 35 and Cheng, 2010 [17]. This procedure needs to be repeated for all possible n S values, i.e., n S = 0, 1, .…”
Section: Theorem 1 For a Given Number Of Machines Problem Tcrc Is Smentioning
confidence: 99%