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 |