Loading...
Please wait, while we are loading the content...
Heuristic Solution to Single Machine Scheduling with Mixture Priority Jobs and Sequence-Dependent Setup Times
| Content Provider | Semantic Scholar |
|---|---|
| Author | Lai, Chun-Mei 賴春美 |
| Copyright Year | 2013 |
| Abstract | In this paper, we considers the single machine scheduling problem with mixture priority jobs and sequence-dependent setup times (MSPMS), which has many real-world applications, particularly, in the IC manufacturing industry. In the MSPMS, there are two classes of end products, namely standard products for spot market and customer specific products for customer orders, and the machine setup times is sequentially dependent on the product families of the jobs processed on the machine. The object of the MSPMS is to minimize the total machine workload without violating the priority restrictions. In this study, we describe the MSPMS in detail and present a heuristic algorithm for resolving the MSPMS. A real-world example is used to illustrate the performance of the proposed algorithm. |
| Starting Page | 1 |
| Ending Page | 1 |
| Page Count | 1 |
| File Format | PDF HTM / HTML |
| Volume Number | 1 |
| Alternate Webpage(s) | https://journal.feu.edu.tw/view_pdf2/98-323.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
