ms·1959년 4월 1일
Discussion: Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags
Management Science
53
피인용
5.6
FWCI
2
IS/마케팅/OM 탑저널 피인용
2
IS/마케팅/OM 탑저널 참고문헌
- 주제작업장 일정 최적화 · 생산·최적화
01Abstract
This note presents an alternate proof of a result of L. G. Mitten, solving the problem of sequencing n jobs through two machines with arbitrary time lags when the job sequences are the same for both machines. The more difficult general problem is also discussed and partially solved.
02연구 흐름
불러오는 중…
03비슷한 논문
불러오는 중…
04이후 연구
불러오는 중…
05선행 연구
불러오는 중…
06서지 정보
- 저널Management Science · 5(3) · 299–303
- 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
- DOI10.1287/mnsc.5.3.299
- 저자Selmer Martin Johnson