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.
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/2546/1/a_sequencing_problem_in_the_weaving_indu_alhaboubi_isi_a1993kt37900005.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|