haku: @author Blazewicz, J. / yhteensä: 5
viite: 2 / 5
| Tekijä: | Blazewicz, J. Domschke, W. Pesch, E. |
| Otsikko: | The job shop scheduling problem: conventional and new solution techniques |
| Lehti: | European Journal of Operational Research
1996 : AUG 23, VOL. 93:1, p. 1-33 |
| Asiasana: | OPERATIONAL RESEARCH SCHEDULING TECHNOLOGY |
| Kieli: | eng |
| Tiivistelmä: | A job shop consists of a set of different machines that perform operations on jobs. Each job has a specified processing order through the machines, i.e., a job is composed of an ordered list of operations each of which is determined by the machine required and the processing time on it. This survey is devoted to an overview of solution techniques available for solving the job shop problem. After a brief recollection of all the trends and techniques the authors concentrate on branching strategies and approximation algorithms belonging to the class of opportunistic and local research scheduling. |
SCIMA