분할법을 이용한 가중납기지연 최소화 문제

참고문헌 (18)

1. "The Shifting Bottleneck Procedure for Job Shop Scheduling", 34, pp.391~401 (1988)
2. "A Computational Study of the Job-Shop scheduling Problem", 3 (1991)
3. "Job Shop Scheduling with Modified Due Dates", 4, pp.11~22 (1983)
4. "Disjunctive Programming", 5, pp.3~51 (1979)
5. "Matchup Scheduling with Multiple Resources", pp.470~483 (1991)
6. "Unrelated Parallel Machine Scheduling for PCB Manufacturing", 27, pp.141~146 (2004)
7. "A Heuristic Algorithm for Resource Constrained Multi-Project Scheduling", 13, pp.110~119 (2000)
8. "A 'Pseudopolynomial' Algorithm for Sequencing Jobs to Minimize Total Tardiness", 1, pp.331~342 (1977)
9. "Resource Constrained Multi-Project Scheduling with Tardy Costs European Journal of Operational Research" (1993)
10. "Journal of Manufacturing and Operations Management", pp.~181 (1988)
11. "A Decomposition Algorithm for the Single Machine Total Tardiness Problem", 1 (1982)
12. "A Zero-One Programming Approach to Scheduling with Limited Resources" (1968)
13. "A Branch and Bound Algorithm for the Generalized Assignment Problem", 8, pp.~103 (1975)
14. "A Price-Directed Approach to Real Time Scheduling of Production Operations", pp.~160 (1991)
15. "Decomposition Algorithms for Single Machine Sequencing with Precedence Relations and Deferral Costs", 23, pp.283~298 (1975)
16. "NP-Complete Scheduling Problems", 10, pp.384~393 (1975)
17. "Priority Rules for Job Shops with Weighted Tardy Costs", 33, pp.95~ (1987)
18. "Priority Rules for Job Shops with Weighted Tardy Costs", 33, pp.95~ (1987)

관련 논문AI추천