Multiple Exchanges of Job Orders for No-Buffer Job Shop Scheduling Problem
This paper describes a procedure for local modifications of a job shop schedule planned under a no-buffer constraint. The modifications are to correct the infeasibility caused by exchanging two consecutive operations on the same machine. An extended disjunctive graph, which has reverse conjunctive a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The Japan Society of Mechanical Engineers
2012-07-01
|
| Series: | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
| Subjects: | |
| Online Access: | https://www.jstage.jst.go.jp/article/jamdsm/6/5/6_661/_pdf/-char/en |
| _version_ | 1818107850145136640 |
|---|---|
| author | Takehiro HAYASAKA Rei HINO |
| author_facet | Takehiro HAYASAKA Rei HINO |
| author_sort | Takehiro HAYASAKA |
| collection | DOAJ |
| description | This paper describes a procedure for local modifications of a job shop schedule planned under a no-buffer constraint. The modifications are to correct the infeasibility caused by exchanging two consecutive operations on the same machine. An extended disjunctive graph, which has reverse conjunctive arcs connecting two consecutive processes, is introduced to identify the operations preventing the feasibility of such a schedule. By exchanging the operating order of these operations, the obtained infeasible schedule can be corrected to a feasible schedule. An example of the modifications for a given job shop schedule is shown to discuss the advantages of the proposed procedure. |
| first_indexed | 2024-12-11T02:06:01Z |
| format | Article |
| id | doaj.art-fb3ac1c2190a43cab2154755dbbc06df |
| institution | Directory Open Access Journal |
| issn | 1881-3054 |
| language | English |
| last_indexed | 2024-12-11T02:06:01Z |
| publishDate | 2012-07-01 |
| publisher | The Japan Society of Mechanical Engineers |
| record_format | Article |
| series | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
| spelling | doaj.art-fb3ac1c2190a43cab2154755dbbc06df2022-12-22T01:24:23ZengThe Japan Society of Mechanical EngineersJournal of Advanced Mechanical Design, Systems, and Manufacturing1881-30542012-07-016566167110.1299/jamdsm.6.661jamdsmMultiple Exchanges of Job Orders for No-Buffer Job Shop Scheduling ProblemTakehiro HAYASAKA0Rei HINO1Department of Mechanical Science and Engineering Graduate School of Engineering Nagoya UniversityDepartment of Mechanical Science and Engineering Graduate School of Engineering Nagoya UniversityThis paper describes a procedure for local modifications of a job shop schedule planned under a no-buffer constraint. The modifications are to correct the infeasibility caused by exchanging two consecutive operations on the same machine. An extended disjunctive graph, which has reverse conjunctive arcs connecting two consecutive processes, is introduced to identify the operations preventing the feasibility of such a schedule. By exchanging the operating order of these operations, the obtained infeasible schedule can be corrected to a feasible schedule. An example of the modifications for a given job shop schedule is shown to discuss the advantages of the proposed procedure.https://www.jstage.jst.go.jp/article/jamdsm/6/5/6_661/_pdf/-char/enjob shop scheduleno-bufferlocal searchdisjunctive graph |
| spellingShingle | Takehiro HAYASAKA Rei HINO Multiple Exchanges of Job Orders for No-Buffer Job Shop Scheduling Problem Journal of Advanced Mechanical Design, Systems, and Manufacturing job shop schedule no-buffer local search disjunctive graph |
| title | Multiple Exchanges of Job Orders for No-Buffer Job Shop Scheduling Problem |
| title_full | Multiple Exchanges of Job Orders for No-Buffer Job Shop Scheduling Problem |
| title_fullStr | Multiple Exchanges of Job Orders for No-Buffer Job Shop Scheduling Problem |
| title_full_unstemmed | Multiple Exchanges of Job Orders for No-Buffer Job Shop Scheduling Problem |
| title_short | Multiple Exchanges of Job Orders for No-Buffer Job Shop Scheduling Problem |
| title_sort | multiple exchanges of job orders for no buffer job shop scheduling problem |
| topic | job shop schedule no-buffer local search disjunctive graph |
| url | https://www.jstage.jst.go.jp/article/jamdsm/6/5/6_661/_pdf/-char/en |
| work_keys_str_mv | AT takehirohayasaka multipleexchangesofjobordersfornobufferjobshopschedulingproblem AT reihino multipleexchangesofjobordersfornobufferjobshopschedulingproblem |