A New Heuristic Method for Job-Shop Scheduling Problem
碩士 === 國立臺灣大學 === 商學研究所 === 90 === We describe an approximation method for solving the minimum makespan problem of job shop scheduling. It makes use of the disjunctive graph, and set the direction of the disjunctive arcs as decision variables. The decision variables, as micro bottlenecks, are cleare...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/93743633218167543628 |