Scheduling design activities with a pull system approach

IEEE Transactions on Robotics and Automation

Volumn 12, Issue 1, 1996, Pages 15-21

  Belhe, Upendra D ^a   Kusiak, Andrew ^a,b  

^a IA United States   (United States)

^b IEEE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; PROCESS CONTROL; PRODUCT DESIGN; PROJECT MANAGEMENT; RESOURCE ALLOCATION; SCHEDULING;

DESIGN ACTIVITIES; DESIGN PROCESS; HEURISTIC ALGORITHMS; MULTIPLE RESOURCE REQUIREMENT; PULL SYSTEM APPROACH;

CONCURRENT ENGINEERING;

EID: 0030085934     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.481747     Document Type: Article

References (27)

1. K. R. Baker, "Sequencing rules and due-date assignments in a job shop," Manage. Sci., vol. 30, no. 9, pp. 1093-1104, 1984.
2. _, Introduction to Sequencing and Scheduling. New York: Wiley, 1974.
3. E. Balas and E. Zemel, "An algorithm for large zero-one knapsack problems," Operations Res., vol. 28, no. 5, pp. 1130-1154, 1980.
4. C. E. Bell and K. Park, "Solving resource-constrained project scheduling problems by A* search," Naval Res. Logistics, vol. 37, pp. 61-84, 1990.
5. N. Christofides, R. Alvarez-Valdes, and J. M. Tamarit, "Project scheduling with resource constraints: A branch and bound approach," European J. Operations Res., vol. 29, pp. 262-273, 1987.
6. E. W. Davis and J. H. Patterson, "A comparison of heuristic and optimum solutions in resource-constrained project scheduling," Manage. Sci., vol. 21, no. 8, pp. 944-955, 1975.
7. E. Demeulemeester and W. Herroelen, "A branch-and-bound procedure for the multiple resource-constrained project scheduling problem," Manage. Sci., vol. 38, no. 12, pp. 1803-1818, 1992.
8. S. Elmaghraby, Activity Networks. New York: Wiley, 1977.
9. S. E. Elmaghraby and J. Kamburowski, "The analysis of activity networks under generalized precedence relations (GPRs)," Manage. Sci., vol. 38, no. 9, pp. 1245-1263, 1992.
10. S. Gorenstein, "An algorithm for project sequencing with resource constraints," Operations Res., vol. 20, no. 4, pp. 835-850, 1972.
11. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnoy Kan, "Optimization and approximation in deterministic sequencing and scheduling: A survey," Ann. Discrete Math., vol. 5, pp. 287-326, 1979.
12. S. C. Graves, "A review of production scheduling," Operations Res., vol. 29, no. 4, pp. 646-675, 1981.
13. O. Icmeli, S. Erenguc, and C. Zappe, "Project scheduling problems: A survey," Int. J. Operations Production Manage., vol. 13, no. 11, pp. 80-91, 1993.
14. R. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. New York: Plenum, 1972, pp. 85-103.
15. I. Kurtulus and E. W. Davis, "Multi-project scheduling: Categorization of heuristic rule performance," Manage. Sci., vol. 28, no. 2, pp. 161-172, 1982.
16. I. Kurtulus and S. C. Narula, "Multi-project scheduling: Analysis of project performance," IIE Trans., vol. 17, no. 1, pp. 58-66, 1985.
17. A. Kusiak and W. He, "Design of components for schedulability, Europen J. Operational Res., vol. 76, pp. 49-59, 1994.
18. F. Londono, K. J. Cleetus, D. M. Nichols, S. Iyer, H. M. Karandikar, S. M. Reddy, S. M. Potnis, B. Massey, A. Reddy, and V. Ganti, "Coordinating a virtual team," CERC, W. Virginia Univ., Morgantown, Tech. Rep., 1992.
19. D. N. Mallick and P. Kouvelis, "Management of product design: A strategic approach," in Intelligent Design and Manufacturing, A. Kusiak, Ed. New York: Wiley, 1992, pp. 157-178.
20. J. Moder and C. Phillips, Project Management with CPM and PERT, 2nd ed. New York: Van Nostrand Reinhold, 1970.
21. Y. Monden, Toyota Production System. Atlanta. GA: Ind. Eng. Manage., 1983, pp. 13-28.
22. J. H. Patterson, "A comparison of exact approaches for solving the multiple constrained resource projecl scheduling problem," Manage. Sci., vol. 30, no. 7, pp. 854-867, 1984.
23. M. Pinedo, "Stochastic scheduling with release dates and due dates," Operations Res., vol. 31, no. 3, pp. 559-572, 1983.
24. L. Schrage, "Solving resource-constrained network problems by implicit enumeration - Non preemptive case," Operations Res., vol. 18, pp. 263-278, 1970.
25. J. P. Stinson, E. W. Davis, and B. M. Khumawala, "Multiple resource-constrained scheduling using branch and bound," AIIE Trans., vol. 10, no. 3, pp. 252-259, 1978.
26. E. Balas, "Machine sequencing via disjunctive graphs: An implicit enumeration algorithm," Operations Res., vol. 17, no. 6, pp. 941-957, 1969.
27. A. Law and W. Kelton, Simulation Modeling and Analysis. New York: McGraw-Hill, 1982.