A complete multiagent framework for robust and adaptable dynamic job shop scheduling

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 37, Issue 5, 2007, Pages 904-916

  Liu, Ning ^a   Abdelrahman, Mohammed A ^a   Ramaswamy, Srini ^b  

^a Tennessee Technological University   (United States)

^b University of Arkansas   (United States)

Author keywords

Dynamic job shop scheduling; Multiagent systems; Scheduling robustness

Indexed keywords

COMPUTATIONAL METHODS; DECISION MAKING; FAULT TOLERANCE; INFORMATION THEORY; SCHEDULING;

DYNAMIC JOB SHOP SCHEDULING; MULTIAGENT FRAMEWORK; SCHEDULING ROBUSTNESS;

MULTI AGENT SYSTEMS;

EID: 34548209982     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2007.900658     Document Type: Article

References (38)

1. V. Jorge Leon, S. D. Wu, and R. H. Storer, "Robustness measures and robust scheduling for job shops," IIE Trans., vol. 26, no. 5, pp. 32-43, Sep. 1994.
2. K. Bhaskaran and M. Pinedo, "Dispatching," in Handbook of Industrial Engineering, G. Salvendy, Ed. New York: Wiley, 1996, ch. 83.
3. J. C. Bean, J. R. Birge, J. Mittenthal, and C. E. Noon, "Matchup scheduling with multiple resources, release dates, and disruptions," Oper. Res., vol. 39, no. 3, pp. 470-483, May.-Jun. 1991.
4. L. K. Church and R. Uzsoy, "Analysis of periodic and event-driven rescheduling policies in dynamic shops," Int. J. Comput. Integr. Manuf., vol. 5, no. 3, pp. 153-163, 1992.
5. V. J. Leon, S. D. Wu, and R. H. Storer, "Agame-theoretic control approach for job shops in the presence of disruptions," Int. J. Prod. Res., vol. 32, no. 6, pp. 1451-1476, 1994.
6. M. Yamamoto and S. Y. Nof, "Scheduling/rescheduling in the manufacturing operating system environment," Int. J. Prod. Res., vol. 23, no. 4, pp. 705-722, 1985.
7. E.-S. Byeon, S. D. Wu, and R. H. Storer, "Decomposition heuristics for robust job-shop scheduling," IEEE Trans. Robot. Autom., vol. 14, no. 2, pp. 303-313, Apr. 1998.
8. S. D. Wu, E.-S. Byeon, and R. H. Storer, "A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness," Oper. Res., vol. 47, no. 1, pp. 113-124, Jan.-Feb. 1999.
9. M. Young, The Techincal Writers Handbook. Mill Valley, CA: University Science, 1989.
10. S.V. Mehta and R. M. Uzsoy, "Predictable scheduling of a job shop subject to breakdowns," IEEE Trans. Robot. Autom., vol. 14, no. 3, pp. 365-378, Jun. 1998.
11. S. V. Mehta and R. Uzsoy, "Predictable scheduling of a single machine subject to breakdowns," Int. J. Comput. Integr. Manuf., vol. 12, no. 1, pp. 15-38, 1999.
12. S. F. Smith, "Knowledge-based production management: Approaches, results, and prospects," Prod. Plan. Control, vol. 3, no. 4, pp. 350-380, 1992.
13. E. Szelke and R. M. Kerr, "Knowledge-based reactive scheduling," Prod. Plan. Control, vol. 5, no. 2, pp. 124-145, 1994.
14. I. M. Ovacik and R. Uzsoy, "Rolling horizon algorithms for a singlemachine dynamic scheduling problem with sequence-dependent setup times," Int. J. Prod. Res., vol. 32, no. 6, pp. 1243-1263, 1994.
15. W. Shen, "Distributed manufacturing scheduling using intelligent agents," IEEE Intell. Syst. Appl., vol. 17, no. 1, pp. 88-94, Jan.-Feb. 2002.
16. R. Davis and R. G. Smith, "Negotiation as a metaphor for distributed problem solving," Artif. Intell., vol. 20, no. 1, pp. 63-109, 1983.
17. R. G. Smith, "The contract net protocol: High-level communication and control in distributed problem solver," IEEE Trans. Comput., vol. C-29, no. 12, pp. 1104-1113, Dec. 1980.
18. G.Y.-J. Lin and J. J. Solberg, "Integrated shop floor control using autonomous agents," IIE Trans., vol. 24, no. 3, pp. 57-71, Jul. 1992.
19. R. Macchiaroli and S. Riemma, "A negotiation scheme for autonomous agents in job shop scheduling," Int. J. Comput. Integr. Manuf., vol. 15, no. 2, pp. 222-232, 2002.
20. M. J. Shaw, "A distributed scheduling method for computed integrated manufacturing: The use of local area networks in cellular systems," Int. J. Prod. Res., vol. 25, no. 9, pp. 1285-1303, 1987.
21. D. M. Upton, "A flexible structure for computer-controlled manufacturing systems," Manuf. Rev., vol. 5, no. 1, pp. 58-72, 1992.
22. T.-T. Dang and B. Frankovic, "Agent-based scheduling in production systems," Int. J. Prod. Res., vol. 40, no. 15, pp. 3669-3679, 2002.
23. T. Kawamura, N. Kase, D. Araki, and A. Osuga, "Development of a distributed cooperative scheduling system based on negotiations between scheduling agents," Syst. Comput. Jpn., vol. 31, no. 1, 2000.
24. J.-S. Liu and K. P. Sycara, "Coordination ofmultiple agents for production management," Ann. Oper. Res., vol. 75, pp. 235-289, 1997.
25. J. Váncza and A. Márkus, "An agentmodel for incentive-based production scheduling," Comput. Ind., vol. 43, no. 2, 2000.
26. P. Dewan and S. Joshi, "Auction-based distributed scheduling in a dynamic job shop environment," Int. J. Prod. Res., vol. 40, no. 5, pp. 1173-1191, 2002.
27. E. Kutanoglu and S. D. Wu, "On combinatorial auction and Lagrangean relaxation for distributed resource scheduling," IIE Trans., vol. 31, no. 9, pp. 813-826, 1999.
28. L. Gou, P. B. Luh, and Y. Kyoya, "Holonic manufacturing scheduling: Architecture, cooperation mechanism, and implementation," Comput. Ind., vol. 37, pp. 213-231, 1998.
29. P. Dewan and S. Joshi, "Dynamic single-machine scheduling under distributed decision-making," Int. J. Prod. Res., vol. 38, no. 16, pp. 3759-3777, 2000.
30. T. E. Morton, "Forward algorithms for forward-thinking managers," in Applications of Management Science, vol. 1, R. L. Schultz, Ed. Greenwich, CT: JAI, 1981, pp. 1-55.
31. T. W. Malone and S. A. Smith, "Modeling the performance of organizational structures," Oper. Res., vol. 36, no. 3, pp. 421-435, May-Jun. 1988.
32. A. Charnes andW.W. Cooper, "Chance-constrained programming," Manage. Sci., vol. 6, pp. 73-79, 1960.
33. J. G. Qi, G. R. Burns, and D. K. Harrison, "The application of parallel multipopulation genetic algorithms to dynamic job-shop scheduling," Int. J. Adv. Manuf. Technol., vol. 16, pp. 609-615, 2000.
34. J. Muth and G. Thompson, Eds., Industrial Scheduling. Englewood Cliffs, NJ: Prentice-Hall, 1963.
35. D. Trentesaux, P. Pesin, and C. Tahon, "Comparison of constraint logic programming and distributed problem solving: A case study for interactive, efficient, and practicable job-shop scheduling," Comput. Ind. Eng., vol. 29, pp. 187-211, 2001.
36. LEKIN, The Stern School of Business, New York University, New York, 2001.
37. S. Eilon and I. G. Chowdhury, "Due dates in job shop scheduling," Int. J. Prod. Res., vol. 14, no. 2, pp. 223-237, 1976.
38. G. Carpaneto, S. Martello, and P. Toth, "Algorithms and codes for the assignment problem," Ann. Oper. Res., vol. 13, pp. 193-223, 1988.