IS Atlas
ms·1985년 5월 1일

Scheduling the General Job-Shop

Jeffrey R. Barker, Graham McMahon

Management Science

83
피인용
2.8
FWCI
1
IS/마케팅/OM 탑저널 피인용
7
IS/마케팅/OM 탑저널 참고문헌
01Abstract

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.

02연구 흐름

불러오는 중…

03비슷한 논문

불러오는 중…

04이후 연구

불러오는 중…

05선행 연구

불러오는 중…

06서지 정보