Scheduling with general job-dependent learning curves
By G. Mosheiov, Jeffrey B. Sidney. European Journal of Operational Research, 2003
317 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/756b7ce274c31eb1d021846882c35cd0be679397
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 bicriteria flowshop scheduling with a learning effect (2008, background): “Mosheiv and Sidney [5] extended the setting to account for the possibility that learning in the production process is faster for some jobs than for others.”
- A state-of-the-art review on scheduling with learning effects (2008, background): “Mosheiov and Sidney (2003) showed that 1=pir ¼ pirai=Cmax; 1=pir ¼ pirai= P Ci, and 1=pir ¼ pirai ; di ¼ d= P ðw1Ei þ w2T i þ w3dÞ can all be solved in O(n3) time by formulating them as assignment problems.”