Loading...
Please wait, while we are loading the content...
Timed Event Graph-based Scheduling for Cyclic Permutation Flow Shop
| Content Provider | CiteSeerX |
|---|---|
| Author | Ren, Si Cheng Xu, De Wang, Fang Tan, Min |
| Abstract | The cyclic permutation flow shop is one flow shop that repetitively produces product mix under permutation schedules. We propose that the cyclic permutation flow shop given the general job sequence can be modeled as a time event graph, based on which the mixed-integer programming method is applied to find the optimal schedule with maximum throughput. Two cases of cyclic permutation flow shops with different buffer capacity (i.e., with buffer and without intermediate |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Cyclic Permutation Flow Shop General Job Sequence Maximum Throughput Time Event Graph Product Mix Mixed-integer Programming Method Flow Shop Optimal Schedule Different Buffer Capacity Permutation Schedule |
| Content Type | Text |
