Due-window assignment scheduling with job-rejection, truncated learning effects and setup times

Scheduling with Group Technology, Resource Allocation, and Learning Effect Simultaneously

“…Input: n, r, θ, ŵij , ûij , ŝi , v ij , σ, ρ, µ, λ First step: Calculate l ′ i by using Lemma 1; Second step: Calculate ι ij by using Lemma 2; Third step: Determine the jobs sequence in each group by Theorem 2; Fourth step: Calculate values Qi l by Equation (11); Fifth step: Determine the optimal group sequence by the AP (13)-( 16); Sixth step: Calculate the optimal resource allocation by Equation (7). Output: optimal resource allocation, optimal sequence Theorem 5.…”

“…In reality, the processing times of jobs are alterable according to resource allocation (Shabtay and Steiner [4], Wang and Cheng [5], Kayvanfar et al [6], Tian [7]) and learning effect (Wu et al [8], Azzouz et al [9], Zhao [10], Liu et al [11]). The learning effect is the efficiency gained through repetitive production.…”