A new approach to the learning effect: Beyond the learning curve restrictions

Solution algorithms for the makespan minimization problem with the general learning model

“…Hence, in this section we present an exact algorithm based on a branch and bound approach and also some fast heuristic algorithms dedicated for this general problem with non-increasing experience based learning models. Thus the methods, that are described further, can be applied in particular for 1jLE S jC max or problems considered by Janiak and Rudek (2008).…”

Scheduling jobs with position and sum-of-processing-time based processing times

“…Extensive surveys of scheduling models and problems involving learning effect (learning curve) and/or deteriorating jobs (time-dependent processing times) are provided by Alidaee and Womer [2], Cheng et al [3], Gawiejnowicz [4], and Biskup [5]. More recent papers which have considered scheduling problems and models with learning effect (learning curve) and/or deteriorating jobs (time-dependent processing times) include Wang and Cheng [6], Eren and Guner [7,8], Eren [9], Wang et al [10,11], Yang and Chand [12], Janiak and Rudek [13], Wu and Lee [14], Lee and Wu [15], Wang et al [16], Wang and Guo [17], Wang et al [18][19][20], Wang and Wang [21], Shen et al [22], Jiang et al [23], Lu and Wang [24], Wang and Wang [25], Wang et al [26], Ji et al [27], Lu et al [28], Wang and Wang [29,30], Wang and Liu [31], Yin et al [32], Huang and Wang [33], Wang and Wang [34], Wang et al [35], Yin et al [36,37], Wang and Wang [38], and Bai et al [39].…”

A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time

“…Recently, Biskup [9] reviewed the scheduling problems with learning effects. Moreover, Janiak and Rudek [10] brought a new learning effect model into the scheduling field where the existing approach is generalized in two ways. First, they relaxed one of the rigorous constraints, and thus each job can provide different experience to the processor in their model.…”