ms·1970년 1월 1일
On Sequencing <i>n</i> Jobs on One Machine to Minimize the Number of Late Jobs
Management Science
42
피인용
6.2
FWCI
1
IS/마케팅/OM 탑저널 피인용
3
IS/마케팅/OM 탑저널 참고문헌
- 주제작업장 일정 최적화 · 생산·최적화
01Abstract
An integer programming formulation for the problem of sequencing jobs on a single machine to minimize the number of late jobs is developed. The structure of the formulation is exploited to obtain the easily stated algorithm (previously developed by Moore [5]) for the solution of the problem and then to compare it to other similar allocation problems, among which is the Knapsack problem.
02연구 흐름
불러오는 중…
03비슷한 논문
불러오는 중…
04이후 연구
불러오는 중…
05선행 연구
불러오는 중…
06서지 정보
- 저널Management Science · 16(5) · 295–297
- 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
- DOI10.1287/mnsc.16.5.295
- 저자William Maxwell