Incremental temporal reasoning in job shop scheduling repair
A working predictive schedule can be useless because of the various external or internal disruptions in a job shop. Total rescheduling may cause problems such as shop floor nervousness. Thus, the job shop scheduling repair (recovery) approach aims at generating a solution satisfying the updated cons...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers
2011
|
| Online Access: | http://hdl.handle.net/1721.1/66211 https://orcid.org/0000-0002-1057-3940 |
| _version_ | 1826208196992172032 |
|---|---|
| author | Huang, Y. Zheng, L. Williams, Brian Charles Tang, L. Yang, H. |
| author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
| author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Huang, Y. Zheng, L. Williams, Brian Charles Tang, L. Yang, H. |
| author_sort | Huang, Y. |
| collection | MIT |
| description | A working predictive schedule can be useless because of the various external or internal disruptions in a job shop. Total rescheduling may cause problems such as shop floor nervousness. Thus, the job shop scheduling repair (recovery) approach aims at generating a solution satisfying the updated constraints and making deviations minimized. We propose an incremental temporal reasoning approach in this paper to solve job shop scheduling repair problems. Specifically, such a problem is formulated as a disjunctive temporal problem (DTP), framed as an optimal constraint satisfaction problem (OCSP) formally, and finally solved by performing an algorithm integrating incremental temporal consistency and efficient candidate generation. Through involving human interactive mechanism, domain experts can make higher quality decisions by balancing makespan and deviations. |
| first_indexed | 2024-09-23T14:02:02Z |
| format | Article |
| id | mit-1721.1/66211 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T14:02:02Z |
| publishDate | 2011 |
| publisher | Institute of Electrical and Electronics Engineers |
| record_format | dspace |
| spelling | mit-1721.1/662112022-10-01T18:41:04Z Incremental temporal reasoning in job shop scheduling repair Huang, Y. Zheng, L. Williams, Brian Charles Tang, L. Yang, H. Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology. Department of Aeronautics and Astronautics Williams, Brian Charles Huang, Y. Williams, Brian Charles A working predictive schedule can be useless because of the various external or internal disruptions in a job shop. Total rescheduling may cause problems such as shop floor nervousness. Thus, the job shop scheduling repair (recovery) approach aims at generating a solution satisfying the updated constraints and making deviations minimized. We propose an incremental temporal reasoning approach in this paper to solve job shop scheduling repair problems. Specifically, such a problem is formulated as a disjunctive temporal problem (DTP), framed as an optimal constraint satisfaction problem (OCSP) formally, and finally solved by performing an algorithm integrating incremental temporal consistency and efficient candidate generation. Through involving human interactive mechanism, domain experts can make higher quality decisions by balancing makespan and deviations. 2011-10-11T21:00:40Z 2011-10-11T21:00:40Z 2010-12 Article http://purl.org/eprint/type/ConferencePaper 978-1-4244-8502-4 978-1-4244-8501-7 2157-3611 INSPEC Accession Number: 11705978 http://hdl.handle.net/1721.1/66211 Huang, Y. et al. “Incremental temporal reasoning in job shop scheduling repair.” Industrial Engineering and Engineering Management (IEEM), 2010 IEEE International Conference on. 2010. 1276-1280. Copyright © 2010, IEEE https://orcid.org/0000-0002-1057-3940 en_US http://dx.doi.org/10.1109/IEEM.2010.5674383 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) 2010 Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. application/pdf Institute of Electrical and Electronics Engineers IEEE |
| spellingShingle | Huang, Y. Zheng, L. Williams, Brian Charles Tang, L. Yang, H. Incremental temporal reasoning in job shop scheduling repair |
| title | Incremental temporal reasoning in job shop scheduling repair |
| title_full | Incremental temporal reasoning in job shop scheduling repair |
| title_fullStr | Incremental temporal reasoning in job shop scheduling repair |
| title_full_unstemmed | Incremental temporal reasoning in job shop scheduling repair |
| title_short | Incremental temporal reasoning in job shop scheduling repair |
| title_sort | incremental temporal reasoning in job shop scheduling repair |
| url | http://hdl.handle.net/1721.1/66211 https://orcid.org/0000-0002-1057-3940 |
| work_keys_str_mv | AT huangy incrementaltemporalreasoninginjobshopschedulingrepair AT zhengl incrementaltemporalreasoninginjobshopschedulingrepair AT williamsbriancharles incrementaltemporalreasoninginjobshopschedulingrepair AT tangl incrementaltemporalreasoninginjobshopschedulingrepair AT yangh incrementaltemporalreasoninginjobshopschedulingrepair |