A SEQUENCING PROBLEM IN THE WEAVING INDUSTRY
The problem of sequencing jobs on a weaving machine is considered where set-up costs are included. The structure of the set-up cost is utilized to develop a polynomial time solution algorithm. The algorithm involves computing the shortest path of a network. An example is solved.
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | article |
| منشور في: |
2020
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/2546/1/a_sequencing_problem_in_the_weaving_indu_alhaboubi_isi_a1993kt37900005.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | The problem of sequencing jobs on a weaving machine is considered where set-up costs are included. The structure of the set-up cost is utilized to develop a polynomial time solution algorithm. The algorithm involves computing the shortest path of a network. An example is solved. |
|---|