A greedy algorithm to determine the number of transporters in a cyclic electroplating process

IIE Transactions (Institute of Industrial Engineers)

Volumn 28, Issue 5, 1996, Pages 347-355

  Armstrong, Ronald ^a   Gu, Shanhong ^a   Lei, Lei ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; ELECTROPLATING; LINEAR PROGRAMMING; MATERIALS HANDLING EQUIPMENT; PERFORMANCE; PROBLEM SOLVING; TRANSPORTATION;

AUTOMATED MANUFACTURING PROCESS; CYCLIC PROCESSING LINE; TRANSPORTERS; WORK IN PROCESS JOB;

OPTIMIZATION;

EID: 0030145165     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179608966281     Document Type: Article

References (16)

1. Ahuja, R., Magananti, T.L., and Orlin, J.B., (1993) Network Flows Theory, Algorithms, and Application, Prentice Hall, Englewood Cliffs, NJ.
2. Armstrong, R. D., Lei, L., and Gu, S., (1994) A bounding scheme for deriving the minimal cycle time of a single transporter n-stage process with time-window constraints. European Journal of Operations Research, 78, 130–140.
3. Bodin, L., Golden, B., Assad, A., and Ball, M., (1983) Routing and scheduling of vehicles and crews - the state of the art. Computers and Operations Research, 10, 62–212.
4. Desrosiers, J., Sauve, M., and Soumis, F., (1988) Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows. Management Science, 34 (8), 1005–1023.
5. Rolen, A., Rinnooy Kan, A., and Trienekens, H., (1987) Vehicle routing with time windows. Operations Research, 35, 266–273.
6. Lei, L., (1992) Adaptive control of feasible cycle times in a processing line with multiple transporters, in Proceedings of International Conference of Pacific Region Management.
7. Lei, L., Determining the optimal starting times in a cyclic schedule with a given routine. Computers and Operations Research, 20 (8), 807–816.
8. Lei, L., and Wang, T. J., (1991) The minimum common-cycle algorithm for cyclic scheduling of two hoists with tune window constraints. Management Science, 37 (12), 1629–1639.
9. Lei, L., Armstrong, R.D., and Gu, S., (1993) Minimizing the fleet size with dependent time-window and single-track constraints. Operations Research Letters, 14 (2), 91–98.
10. Lin, H.C., Egbelu, P. J., and Wu, C. T., (1995) A two-robot printed circuit board assembly system. Journal of Computer Integrated Manufacturing, (in the press).
11. Matsuo, H., Shang, S.-C., Sullivan, R. S., (1991) Crane scheduling and machine layout problem in a computer-integrated manufacturing environment. Management Science, 37 (5), 587–606.
12. Ramudhin, A., and Ratliff, H. D., (1991) Scheduling in process industries. Working Paper, Georgia Institute of Technology.
13. Shapiro, G. W., (1985) Hoist Scheduling for a PCB Electroplating Facility. M.S. thesis. North Carolina State University.
14. Shapiro, G. W., and Nuttle, H. L. W., (1988) Hoist scheduling for a PCB electroplating facility. HE Transactions, 20 (2), 157–167.
15. Solomon, M. M., (1987) Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research, 32 (2), 254–265.
16. Solomon, M. M., and Desrosiers, J., (1988) Time window constrained routing and scheduling problems. Transportation Science. 22 (1), 1–13.