Academic Journal
Revised
| العنوان: | Revised |
|---|---|
| المؤلفون: | Dan Trietsch, Kenneth R. Baker |
| المساهمون: | The Pennsylvania State University CiteSeerX Archives |
| المصدر: | http://staff.business.auckland.ac.nz/staffpages/dtrietsch/AHpaper_Trietsch_Baker.pdf. |
| سنة النشر: | 2006 |
| المجموعة: | CiteSeerX |
| الوصف: | We consider the single-machine sequencing model with stochastic processing times and the problem of minimizing the number of stochastically tardy jobs. In general, this problem is NP-hard. Recently, however, van den Akker and Hoogeveen found some special cases that could be solved in polynomial time. We generalize their findings by providing a polynomial solution for any stochastically ordered processing times. We then show that the algorithm applies as well to basic linearly associated processing times, thus allowing more realistic modeling of positive dependencies. |
| نوع الوثيقة: | text |
| وصف الملف: | application/pdf |
| اللغة: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.2989; http://staff.business.auckland.ac.nz/staffpages/dtrietsch/AHpaper_Trietsch_Baker.pdf |
| الاتاحة: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.2989 http://staff.business.auckland.ac.nz/staffpages/dtrietsch/AHpaper_Trietsch_Baker.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| رقم الانضمام: | edsbas.F1A75B7E |
| قاعدة البيانات: | BASE |
| الوصف غير متاح. |