论文信息 - Scheduling the General Job-Shop

Scheduling the General Job-Shop

A family of algorithms is described for finding optimum schedules for job-shops. The algorithms are of a branch and bound type but have a complete schedule associated with each node of the search tree. Branching from nodes is based on important conflicts in the schedule. Some results are provided.

Jeffrey R. Barker | Graham B. McMahon | J. R. Barker | G. McMahon

[1] Jan Karel Lenstra,et al. Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .

[2] B. J. Lageweg,et al. Surrogate duality relaxation for job shop scheduling , 1983, Discret. Appl. Math..

[3] J. Lenstra,et al. Job-Shop Scheduling by Implicit Enumeration , 1977 .

[4] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .

[5] Egon Balas,et al. Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[6] Jeffrey Robert Barker. Primal search tree algorithms for the general job shop problem , 1981 .

[7] Graham McMahon,et al. On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..