Minimizing the total weighted completion time on unrelated parallel machines with stochastic times

Proceedings - Winter Simulation Conference

Volumn 2005, Issue , 2005, Pages 2141-2147

  Arnaout, Jean Paul M ^a   Rabadi, Ghaith ^a  

^a Old Dominion University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; HEURISTIC METHODS; JOB ANALYSIS; OPTIMIZATION; RANDOM PROCESSES;

COMPLETION TIME; PARALLEL MACHINES; SETUP TIMES;

PARALLEL PROCESSING SYSTEMS;

EID: 33846696479     PISSN: 08917736     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WSC.2005.1574499     Document Type: Conference Paper

References (20)

1. Akkiraju, R., S. Murthy, P. Keskinocak, and F. Wu. 1998. Multi machine scheduling: an agent-based approach. In Proceedings of Innovative Applications of Artificial Intelligence, July 1998: 1013-1018.
2. Bruno, J.L., P.J. Downey, and G.N. Frederickson. 1981. Sequencing tasks with exponential service times to minimize the expected flow time or makespan. Journal of the ACM 28 (1): 100-113.
3. Ghirardi, M., and C.N. Potts. 2004. Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. European Journal of Operational Research. In Press.
4. Glazebrook, K. D. 1979. Scheduling tasks with exponential service times on parallel machines. Journal of Applied Probability 16: 685-689.
5. Karp, R.M. 1972. Reducibility among combinatorial problems. Complexity of Computer Communications. Plenum Press, New York: 85-103.
6. rd ed. McGraw-Hill Companies, New York.
7. Kim, D-W, K-H Kim, W. Jang, and F. Chen. 2002. Unrelated parallel machine scheduling with setup times using simulated annealing. Robotics and Computer Integrated Manufacturing 18: 223-231.
8. Kim, D-W, Na, D. & Chen, F. 2003. Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robotics and Computer Integrated Manufacturing 19: 173-181.
9. Liaw, C., Y. Lin, C. Cheng, and M. Chen. 2003. Scheduling unrelated parallel machines to minimize total weighted Tardiness. Computers & Operations Research 30: 1777-1789.
10. Low, C. 2004. Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Computers and operations research. In Press.
11. Mohring, R., A. Shulz, and M. Uetz. 1999. Approximation in stochastic scheduling: the power of LP-based priority policies. Journal of the ACM (JACM) 46 (6): 924-942.
12. Mosheiov, G., and J. Sidney. 2003. Scheduling with general job-dependent learning curves. European Journal of Operational Research 147: 665-670.
13. Pinedo, M. 1995. Scheduling: Theory, Algorithms, and Systems. Prentice Hall international series in industrial and systems engineering, New Jersey.
14. Potts, C., and M.Y. Kovalyov. 2000. Scheduling with batching: A review. European Journal of Operational Research 120: 228-249.
15. Pourbabai, B. 1985. One stage scheduling of preemptive jobs on parallel machines with setup times and due dates. In Proceedings of American Institutions of Industrial Engineering, Annual Conference Convention 1985, 258: 525-528.
16. Reuter, R., and J. Hulsmann. 2000. Achieving Design Targets through Stochastic Simulation. In Proceedings of the Madymo Users' Conference, Paris 2000. Available online via 〈http://www.easi.de/company/publications/ mad_2000/mad_2000.pdf〉 [accessed March 20, 2005].
17. Weber, R.R., P. Varaiya, and J. Walrand. 1986. Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime. Journal of Applied Probability 23: 841-847.
18. Weiss, G. 1992. Turnpike optimality of Smith's rule in parallel machines stochastic scheduling. Mathematics of Operations Research 17: 255-270.
19. Weiss, G., and M. Pinedo. 1980. Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions. Journal of Applied Probability 17: 187-202.
20. Weng, M., J. Lu, and H. Ren. 2001. Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. International Journal of Production Economics 70: 215-226.