SCHEDULING THE GENERAL JOB-SHOP

被引：35

作者：

BARKER, JR

MCMAHON, GB

机构：

[1] Scientia Pty Ltd, Kensington, Aust, Scientia Pty Ltd, Kensington, Aust

来源：

MANAGEMENT SCIENCE | 1985年 / 31卷 / 05期

关键词：

COMPUTER PROGRAMMING - Algorithms - PRODUCTION CONTROL;

D O I：

10.1287/mnsc.31.5.594

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：594 / 598

页数：5

共 9 条

[1]

Baker K., 1974, INTRO SEQUENCING SCH

[2] MACHINE SEQUENCING VIA DISJUNCTIVE GRAPHS - AN IMPLICIT ENUMERATION ALGORITHM [J].