A MODIFIED SHIFTING BOTTLENECK PROCEDURE FOR JOB-SHOP SCHEDULING

被引：68

作者：

DAUZEREPERES, S

LASSERRE, JB

机构：

[1] Laboratoire d'Automatique et d'Analyse des Systemes du CNRS, Toulouse Cedex, 31077

来源：

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 1993年 / 31卷 / 04期

关键词：

D O I：

10.1080/00207549308956766

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We propose a modified version of the Adams et al. shifting bottleneck (SB) procedure for job-shop scheduling. By modifying Carlier's algorithm extensively used in the SB procedure, we eliminate some drawbacks. Computational results are reported with good performances, particularly on the classical 10-10 and 5-20 problems.

引用

页码：923 / 932

页数：10

共 10 条

[1]

Adams J., Balas E., Zawack D., The shifting bottleneck procedure for job shop scheduling, Management Science, 34, pp. 391-401, (1988)

[2]

Carlier J., The one-machine sequencing problem, European Journal of Operational Research, 11, pp. 42-47, (1982)

[3]

Carlier J., Pinson E., An algorithm for solving the job-shop problem, Management Science, 35, pp. 164-176, (1989)

[4]

Dauzere-Peres S., Lasserre J.-B., A Modified Shifting Bottleneck Procedure for Job Shop Scheduling, (1990)

[5]

Fisher H., Thompson G.L., Probabilistic learning combinations of local job-shop scheduling rules, Industrial Scheduling, pp. 225-251, (1963)

[6]

Lageweg B.J., Lenstra J.K., Rinnooy Kan A., Job-shop scheduling by implicit enumeration, Management Science, 24, pp. 441-450, (1977)

[7]

Lawler E.L., Lenstra J.K., Rinnooy Kan A., Shmoys D.B., Sequencing and Scheduling: Algorithms and Complexity, (1989)

[8]

McMahon G., Florian M., On scheduling with ready times and due dates to minimize maximum lateness, Operations Research, 23, pp. 475-482, (1975)

[9]

Potts C.N., Analysis of a heuristic for one machine sequencing with release dates and delivery times, Operations Research, 28, pp. 1436-1441, (1980)

[10]

Roy B., Sussman B., Les Problemes D'ordonnancernent Avec Contraintes Disjonctives, (1964)

← 1 →