Loading...
Please wait, while we are loading the content...
Similar Documents
A machine-order search space for job-shop scheduling problems
| Content Provider | Semantic Scholar |
|---|---|
| Author | Choi, S. H. Yang, Fu-Yu |
| Copyright Year | 2003 |
| Abstract | This paper proposes a methodology for real-time job-shop scheduling problems. It introduces a new classification of the scheduling methods for JSSPs with emphasis on the search methods and the significance of the search space. Subsequently, a machine-order search space is proposed as a new framework in which different single-machine scheduling algorithms and search methods can be incorporated to solve JSSPs. An optimization model relating makespan minimization and the proposed machine-order search space is also described. The proposed methodology finds an optimal solution by searching a proper machine order in the machine-order search space and scheduling the machines one by one in this order. Such an approach significantly reduces the size of the search space, and hence the computing efforts. As a result, scheduling of large JSSPs in real-time becomes practicable. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.blackwellpublishing.com/content/bpl_images/Journal_Samples2/ITOR0969-6016~10~6/430.PDF |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Algorithm Computation (action) Convex optimization Feasible region Makespan Mathematical optimization Real-time clock Real-time computing Real-time transcription Scheduling (computing) Scheduling - HL7 Publishing Domain Single-machine scheduling Solutions |
| Content Type | Text |
| Resource Type | Article |
