IS Atlas
ms·1990년 4월 1일

Some Heuristics for Scheduling Jobs on Parallel Machines with Setups

Kut C. So

Management Science

66
피인용
7.9
FWCI
3
IS/마케팅/OM 탑저널 피인용
3
IS/마케팅/OM 탑저널 참고문헌
01Abstract

This paper studies the problem of scheduling jobs on parallel machines with setup times. When a machine switches from processing one type of job to another type, setup times are incurred. The problem is to find a feasible schedule for each machine which maximizes the total reward. We study three heuristics for solving this problem. Analytical and empirical results of the heuristics are given.

02연구 흐름

불러오는 중…

03비슷한 논문

불러오는 중…

04이후 연구

불러오는 중…

05선행 연구

불러오는 중…

06서지 정보