论文信息 - An efficient algorithm for the job-shop problem with two jobs

An efficient algorithm for the job-shop problem with two jobs

It is well known that job-shop scheduling problems with two jobs can be formulated as shortest path problems with obstacles in the plane. A reduction of this problem to an unrestricted shortest path problem in a special networkN is constructed inO (n logn) steps wheren is the number of obstacles. The shortest path inN can be found in timeO (n).

P. Bruckner | P. Bruckner

[1] James R. Jackson,et al. An extension of Johnson's results on job IDT scheduling , 1956 .

[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[3] George L. Nemhauser,et al. A Geometric Model and a Graphical Algorithm for a Sequencing Problem , 1963 .

[4] I. Adiri,et al. An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem , 1982, Math. Oper. Res..

[5] S. Akers. Letter to the Editor—A Graphical Approach to Production Scheduling Problems , 1956 .

[6] Wlodzimierz Szwarc,et al. SOLUTION OF THE AKERS-FRIEDMAN SCHEDULING PROBLEM , 1960 .