Resource sharing and scheduling for cyclic production in a computer-integrated manufacturing cell

Computers and Industrial Engineering

Volumn 36, Issue 3, 1999, Pages 525-547

  Samaddar, Subhashish ^a   Rabinowitz, Gad ^b,c   Mehrez, Abraham ^b,c  

^a GEORGIA STATE UNIVERSITY   (United States)

^b KENT STATE UNIVERSITY   (United States)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DECISION MAKING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PRODUCTION CONTROL; RESOURCE ALLOCATION; SCHEDULING;

BRANCH AND BOUND ALGORITHM; CYCLIC PRODUCTION; RESOURCE SHARING;

COMPUTER INTEGRATED MANUFACTURING;

EID: 0033163761     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0360-8352(99)00147-3     Document Type: Article

References (24)

1. Agnetis A, Lucertini M, Nicolo F. Flow management in flexible manufacturing cells with pipeline operations. Manage Sci 1993;39(3):294-306.
2. Atmani A, Lashkari RS, Caron RJ. A mathematical programming approach to joint cell formation and operation allocation in cellular manufacturing. Int J Prod Res 1995;33(1):1-15.
3. Blazewicz J, Sethi SP, Sriskandarajah C. Scheduling of robot moves and parts in a robotic cell. Report G-89-36, Montreal, Canada: GERAD, Ecole Polytechnique, 1989.
4. Canada JR. Annotated bibliography on justification of computer-integrated manufacturing systems. Eng Econ 1986;31(2):137-50.
5. Chandra C, Irani SA, Arora SR. Clustering effectiveness of permutaion generation heuristics for machine-parts matrix clustering. J Manuf Syst 1993;12(5):388-408.
6. Chen HG, Guerrero HH. A rule-based scheduling system for flexible manufacturing cells. Working paper, Notre Dame, IN: Department of Management, University of Notre Dame, 1991.
7. Co HC, Biermann JS, Chen SK. A methodical approach to the flexible-manufacturing-system batching, loading and tool configuration problems. Int J Prod Res 1990;28:2171-86.
8. Coffman EG. Computer and job-shop scheduling theory. New York: John Wiley & Sons, 1976.
9. Daniels RL, Sarin RK. Single machine scheduling with controllable processing times and number of jobs tardy. Oper Res 1989;37:981-4.
10. Daniels RL. Resource allocation and multi-project scheduling. In: Slowinski R, Weglarz J, editors. Advances in project scheduling. New York: Elsevier, 1989.
11. Elmaghraby SE. Activity networks: project planning and control by network models. John Wiley & Sons, 1977.
12. Graves SC. Using Lagrangean techniques to solve hierarchical production planning problems. Manage Sci 1982;28(3):260-74.
13. Karmarkar N. A new polynomial time algorithm for linear programming. Combinatorica 1984;4:373-95.
14. Khatchian L. A polynomial time algorithm for linear programming. Sov Math Doklady 1979;20:191-4.
15. Maimon OZ, Gershwin SB. Dynamic scheduling and routing for flexible manufacturing systems that have unreliable machines. Oper Res 1988;36(2):279-91.
16. Maimon OZ, Nof SY. Coordination of robots sharing assemble task. ASME J Dyn Syst Meas Control 1985;107(4):292-307.
17. Nasr N, Elsayed EA. Job shop scheduling with alternative machines. Int J Prod Res 1990;28(9):1595-609.
18. Salkin HM, Mathur K. Foundations of integer programming. New York: North-Holland, 1989.
19. Samaddar S. A monolithic approach for resource sharing and scheduling in multirobot assembly cell. Ph.D. dissertation, Kent State University, UMI Dissertation Information Service, MI, 1991.
20. Vanelli A, Hall RG. An eigenvector solution methodology for finding part-machine families. Int J Prod Res 1993;31(2):325-49.
21. Whitney DE. Planning programmable assembly systems. In: Nof SY, editor. Handbook of industrial robotics. New York, NY: John Wiley & Sons, 1985 (ch. 62).
22. Whitney DE. of The Charles Stark Draper Laboratory, MA, personal communication, 1988.
23. Wilhelm WE, Sarin SC. A structure for sequencing robot activities in machine loading applications. Int J Prod Res 1985;23(1):47-64.
24. Yu PL. Multiple-criteria decision making: concepts, techniques and extensions. New York: Plenum Press, 1985.