haku: @indexterm PROBLEM FORMULATION / yhteensä: 70
viite: 3 / 70
| Tekijä: | Mascis, A. Pacciarelli, D. |
| Otsikko: | Job-shop scheduling with blocking and no-wait constraints |
| Lehti: | European Journal of Operational Research
2002 : DEC, VOL. 143:3, p. 498-517 |
| Asiasana: | SCHEDULING JOB ANALYSIS MANAGEMENT PROBLEM FORMULATION |
| Kieli: | eng |
| Tiivistelmä: | In this paper, the authors study the job-shop scheduling problem with blocking and/or no-wait constraints. A blocking constraint models the absence of storage capacity between machines, while a no-wait constraint occurs when two consecutive operations in a job must be processed without any interruption. The authors formulate the problem by means of a generalization of the disjunctive graph of Roy and Sussman, that the authors call an alternative graph, and investigate the applicability to the blocking and no-wait cases of some of the most effective ideas from the literature on the job shop with unlimited buffers. The authors show that several key properties, used to design heuristic procedures, do not hold in the blocking and no-wait cases. |
SCIMA