Distributed computing approaches toward manufacturing scheduling problems

IIE Transactions (Institute of Industrial Engineers)

Volumn 30, Issue 4, 1998, Pages 379-390

  Keyser, Thomas K ^a   Davis, Robert P ^b  

^a Malik and Seeme Hasan School of Business   (United States)

^b AMRL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; MATHEMATICAL MODELS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PRODUCTION ENGINEERING; RESOURCE ALLOCATION; SCHEDULING;

MANUFACTURING SCHEDULING;

COMPUTER AIDED MANUFACTURING;

EID: 0032046606     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179808966477     Document Type: Article

References (37)

1. Brawer, S., (1989) Introduction to Parallel Programming, Academic Press, New York.
2. Silva, E.D.E., and Gerla, M., (1991) Queuing network models for load balancing in distributed systems. Journal of Parallel and Distributed Computing, 12, 24–38.
3. Krueger, P., and Chawla, R., (1991) The stealth distributed scheduler, in IIE International Conference on Distributed Computing, IEEE Computer Society, Los Alamitos, CA. pp. 336–343.
4. Finchman, A.E., and Ford, B., (1993). Parallel Computation, Clarendon Press, Oxford.
5. Liebowitz, B.H., and Carson, J.H., (1985) Multiple Processor Systems for Real-Time Applications. Prentice Hall, Englewood Cliffs, NJ.
6. El-Dessouki, O.I., and Huen, W.H., (1980) Distributed enumeration between computers. IEEE Transactions on Computers, C-29 (9), 818–825.
7. Kumar, V., and Rao, V.N., (1987) Parallel depth first search, part 1, implementation. International Journal of Parallel Programming, 16 (6), 479–499.
8. Kumar, V., and Rao, V.N., (1987) Parallel depth first search, part 2, analysis. International Journal of Parallel Programming, 16 (6), 501–519.
9. Pruul, E.A., Nemhauser, G.L., and Rushmeier, R.A., (1988) Branch and bound and parallel computation a historical note. Operations Research Letters, 7, 65–69.
10. Kindervater, G., and Trienekens, H., (1988) Experiments with parallel algorithms for combinatorial problems. European Journal of Operations Research, 33, 65–81.
11. Rushmeier, R.A., and Nemhauser, G.L., (1993) Experiments with parallel branch and bound algorithms for the set covering problem. Operations Research Letters, 13, 277–285.
12. Paramanick, I., and Kuhl, J.G., (1992) Application of inherently parallel heuristic methodology to flow shop scheduling, in IEEE Southeastcon, IEEE, New York, NY. pp. 155–162.
13. Taillard, E.D., (1994) Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing, 6 (2), 108–117.
14. Conway, R.W., Maxwell, W.L., and Miller, L.W., (1967) Theory of Scheduling, Addison-Wesley, Reading, MA.
15. French, S., (1986) Scheduling and Sequencing, John Wiley, New York.
16. Atallah, M.J., Black, CL., and Marinesco, D.C., (1992) Models and algorithms for coscheduling computer intensive tasks on a network of workstations. Journal of Parallel and Distributed Computing, 16, 319–327.
17. Barr, R.S., and Hickman, B.L., (1993) Reporting computational experiments with parallel algorithms issues, measures and experts opinions. ORSA Journal on Computing, 5 (1), 2–18.
18. Miller, D., and Pekny, J., (1989). Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem. Operations Research Letters, 8, 129–135.
19. Wilson, G.V., (1993) A glossary of parallel computing terminology. IEEE Parallel and Distributed Technology, 1 (1), 52–67.
20. Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., and Sunderam, V., (1994) PVM 3 Users Guide and Manual, Oak Ridge National Laboratory, Oak Ridge, TN.
21. Shoja, G.C., (1991) A distributed facility for load sharing and parallel processing among workstations. Journal of Systems Software, 14, 163–172.
22. Parsons, I., (1994) Evaluation of Distributed Communication Systems. University of Alberta, Ontario, Canada.
23. Garg, V.K., and Ghosh, J., (1994) Repeated computation of global functions in a distributed environment. IEEE Transactions on Parallel and Distributed Systems, 5 (8), 823–834.
24. Willebeek-LeMair, M.H., and Reeves, A.P., (1993) Strategies for dynamic load balancing on highly parallel computers. IEEE Transactions on Parallel and Distributed Systems, 4 (9), 979–993.
25. El-Rewini, H., and Lewis, T., (1993) Parallel and distributed systems from theory to practice. IEEE Parallel and Distributed Technology, 1 (3), 7–11.
26. Gendron, B., and Cranic, T.G., (1994) Parallel branch and bound algorithms survey and synthesis. Operations Research, 42 (6), 1042–1066.
27. Lai, T.-H., and Sahji, S., (1984) Anomalies in parallel branch and bound algorithms. Communications of the ACM, 27 (6), 594–602.
28. Cannon, T.L., and Hoffman, K.L., (1990) Large scale 0-1 linear programming on distributed workstations. Annals of Operations Rcsearch. 42 (6), 181–217.
29. Baker, K.R., and Scudder, G.D., (1990) Sequencing with earliness and tardiness penalties a review. Operations Research, 38 (1), 22–36.
30. Garey, M.R., Tarjan, R.T., and Wilfong, G.T., (1988) One processor scheduling with symmetric earliness and tardiness penalties. Mathematics and Operations Research, 13 (2), 330–348.
31. Hall, N.G., Kubiak, W., and Sethi, S.P., (1991) Earliness-tardiness scheduling problems, 2 deviation of completion times about a restrictive common due date. Operations Research, 39 (5), 847–856.
32. Dudek, R.A., Panwalker, S.S., and Smith, M.L., (1992) The lessons of flowshop scheduling research. Operations Research, 40 (1), 7–13.
33. Baker, K.R., (1975) A comparative study of flow-shop algorithms. Operations Research, 23 (1), 62–73.
34. Park, Y.B., Pegden, C.D., and Enscore, E.E., (1984) A survey and evaluation of static flowshop scheduling heuristics. International Journal of Production Research, 22 (1), 127–141.
35. Blackstone, J.H., Phillips, D T., and Hogg, G L., (1982) A state of the art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, 20 (1), 27–45.
36. Garfinkel, R.S., and Nemhauser, G.L., (1972) Integer Programming, John Wiley, New York.
37. Potts, C.N., and Wassenhove, L.N.V., (1985) A branch and bound algorithm for the total weighted tardiness problem. Operations Research, 33 (2), 363–377.