Scheduling problems with a learning effect
By G. Mosheiov. European Journal of Operational Research, 2001
377 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/38560977eb78b688fe98bfbec88ce880de8a39dd
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Industrial and Manufacturing Engineering
Citations in the corpus
- A concise survey of scheduling with time-dependent processing times (2004, background): “Biskup (1999) and Mosheiov (2001) investigated the scheduling prob- lems with learning considerations in a nonlinear form.”
- A state-of-the-art review on scheduling with learning effects (2008, methodology): “1=pir 1⁄4 pir ; di 1⁄4 d= P ðw1Ei þ w2T i þ w3dÞ O(n(3)) Ass Mosheiov and Sidney (2003) 1=pir 1⁄4 piri ; di 1⁄4 d= P Ui O(n 3 logn) s. Ass Mosheiov and Sidney (2005) 1=pir 1⁄4 piri= P U i NP-hard Lin (in press) Qm=pir 1⁄4 pir= P Ci O((2n) /m!) m.”
- Scheduling with general job-dependent learning curves (2003, methodology): “As in Mosheiov (2001b), let ni denote the number of jobs assigned to machine i, i ¼ 1; . . . ;m, ( Pm i¼1 ni ¼ n).”