A desired load distribution model for scheduling of unrelated parallel machines

International Journal of Production Research

Volumn 43, Issue 23, 2005, Pages 5033-5046

  Li, Y ^a   Shen, Weiming ^a   Ghenniwa, H ^b   Wang, C ^b  

^a NATIONAL RESEARCH COUNCIL CANADA   (Canada)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Agent based scheduling; Dynamic programming; Load balancing; Scheduling; Unrelated parallel machines

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; ELECTRIC LOAD MANAGEMENT; MACHINERY; OPTIMIZATION;

AGENT-BASED SCHEDULING; LOAD BALANCING; UNRELATED PARALLEL MACHINES;

SCHEDULING;

EID: 30844437514     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540412331333450     Document Type: Review

References (17)

1. Amen, M., An exact method for cost-oriented assembly line balancing. Int. J. Prod. Econ., 2000, 64, 187-195.
2. Baker, A.D., A survey of factory control algorithms that can be implemented in a multi-agent heterarchy: Dispatching, scheduling, and pull. J. Manuf. Syst., 1998, 17, 297-320.
3. Becker, C. and Scholl, A., A survey on problems and methods in generalized assembly line balancing. Jenaer Schriften zur Wirtschaftswissenschaft 21/03, FSU Jena, 2003 (http://www.wiwi.uni-jena.de/Entscheidung/alb/GALBP-Survey.pdf).
4. Bilsen, G., Engels, M., Lauwereins, R. and Peperstraete, J.A., Survey of algorithms for static load balancing. Int. J. Mini Microcomput., 1996, 18, 92-99.
5. Breit, J., Schmidt, G. and Strusevich, V.A., Two-machine open shop scheduling with an availability constraint. Oper. Res. Letters, 2001, 29, 65-77.
6. Chen, H., Chu, C. and Proth, J., An improvement of the Lagrangean relaxation approach for job shop scheduling: A dynamic programming method. IEEE Trans. Robot. Autom., 1998, 14, 786-795.
7. Davis, R. and Smith, R. G., Negotiation as a metaphor for distributed problem solving. Artif. Intell., 1983, 20, 63-109.
8. French, S., Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, 1982 (John Wiley & Sons: New York).
9. Kang, J. and Park, S., Algorithms for the variable sized bin packing problem, Euro. J. Oper. Res., 2000, 147, 365-372.
10. Larson, R.E. and Casti, J.L., Principles of Dynamic Programming, 1978 (Marcel Dekker, Inc.: New York).
11. Li, Y. and Shen, W., Complexity analysis of multi-factor manufacturing scheduling problems, 2003. Accepted for the SPIE Conference on Intelligent Systems in Design and Manufacturing V, October 25-28, 2004.
12. Pinedo, M., Scheduling Theory, Algorithms, and Systems, 2nd edn, 2002 (Prentice Hall: Upper Saddle River, New Jersey).
13. Sandholm, T., Algorithm for optimal winner determination in combinatorial auctions. Artif. Intel., 2002, 135, 1-54.
14. Shen, W., Distributed manufacturing scheduling using intelligent agents. IEEE Intel. Syst., 2002, 17, 88-94.
15. Shen, W., Li, Y., Ghenniwa, H. and Wang, C., Adaptive negotiation for agent-based grid computing. Proceedings of AAMAS2002 Workshop on Agentcities: Challenges in Open Agent Environments, pp. 32-36, 2002 (Bologna, Italy).
16. Tzafestas, S., and Triantafyllakis, A., Deterministic scheduling in computing and manufacturing system: A survey of models and algorithms. Maths. Comput. Simul., 1993, 35, 397-434.
17. Yu, L., Shih, H.M., Pfund, M., Carlyle, W.M. and Powler, J.W., Scheduling of unrelated parallel machines: An application to PWB manufacturing. IIE Trans., 2002, 34, 921-931.