Deterministic and stochastic scheduling with teamwork tasks

Naval Research Logistics

Volumn 51, Issue 6, 2004, Pages 818-840

  Cai, Xiaoqiang ^a   Zhou, Xian ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

General cost functions; Maximum cost; Scheduling; Stochastic criteria; Stochastic scheduling; Teamwork tasks; Total completion time

Indexed keywords

COMPUTATIONAL METHODS; COSTS; JOB ANALYSIS; MATHEMATICAL MODELS; OPTIMIZATION; PRODUCTION CONTROL; RANDOM PROCESSES;

GENERAL COST FUNCTIONS; MAXIMUM COSTS; STOCHASTIC CRITERIA; STOCHASTIC SCHEDULING; TEAMWORK TASKS; TOTAL COMPLETION TIME;

SCHEDULING;

EID: 4444344468     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.20021     Document Type: Article

References (31)

1. A.K. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis, Scheduling independent multiprocessor tasks, Algorithmica 32 (2002), 247-261.
2. K.R. Baker, Elements of sequencing and scheduling, Amos Tuck School, Hanover, NH, 1995.
3. J.J. Bartholdi, D.D. Eisenstein, and R.D. Foley, Performance of bucket brigades when work is stochastic, Oper Res 49 (2001), 710-719.
4. V. Bharadwaj, X. Li, and C.C. Ko, Design and analysis of load distribution strategies with start-up costs in scheduling divisible loads on distributed networks, Math Comput Modelling 32 (2000), 901-932.
5. L. Bianco, J. Blazewicz, P. Dell'Olmo, and M. Drozdowski, Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Ann Oper Res 58 (1995), 493-517.
6. J. Blazewicz, K. Ecker, G. Schmidt, and J. Weglarz, Scheduling in computer and manufacturing systems, Springer-Verlag, Berlin, 1993.
7. J. Blazewicz, M. Drozdowski, and J. Weglarz, Scheduling multiprocessor tasks - a survey, Micro-comput Appl 13 (1994), 89-97.
8. X. Cai, C.-Y. Lee, and C.L. Li, Minimizing total flow time in two-processor task systems with prespecified processor allocations, Naval Res Logist 45 (1998), 231-242.
9. X. Cai, C.-Y. Lee, and T.L. Wong, Multi-processor task scheduling to minimize the maximum tardiness and the total completion time, IEEE Trans Robot Automat 16 (2000), 824-830.
10. M. Drozdowski, Scheduling multiprocessor tasks - an overview, European J Oper Res 94 (1996), 215-230.
11. E.F. Gehringer, D.P. Siewiorek, and Z. Segall, Parallel processing: The Cm* experience, Digital Press, Bedford, MA, 1987.
12. E.S. Gel, W.J. Hopp, and M.P. Van Oyen, Factors affecting opportunity of worksharing as a dynamic line balancing mechanism, IIE Trans 34 (2002), 847-863.
13. J.C. Gittins, Multi-armed bandit allocation indices, Wiley, Chichester, 1989.
14. J. Herrmann, C.-Y. Lee, and J. Snowdon, Classification of static scheduling problems, Complexity in numerical optimization, P.M. Pardalos (Editor), World Scientific, Singapore, 1993, pp. 203-253.
15. A.L. Hopkins, J.M. Lala, and T.B. Smith, FTMP - a highly reliable fault-tolerant multiprocessor for aircraft, Proc IEEE 66 (1978), 1221-1239.
16. C.C. Huang and G. Weiss, Scheduling jobs with stochastic processing times and due dates to minimize total tardiness, Commun Statist Stochastic Models 8 (1992), 529-541.
17. J.R. Jackson, Scheduling a production line to minimize maximum tardiness, Management Science Research Project, Research Report 43, UCLA, Los Angeles, CA, 1995.
18. H. Krawczyk and M. Kubale, An approximation algorithm for diagnostic test scheduling in multi-computer systems, IEEE Trans Comput C34 (1985), 869-872.
19. W. Kuo, W.-T.K. Chien, and T. Kim. Reliability, yield, and stress burn-in, Kluwer, Boston, 1998.
20. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D. Shmoys, Sequencing and scheduling: Algorithms and complexity, Handbook in operations research and management science, S.S. Graves, A.H.G. Rinnooy Kan, and P. Zipkin (Editors), North-Holland, Amsterdam, 1993, pp. 445-522.
21. T.E. Morton and D.W. Prentico, Heuristic scheduling systems, Wiley, New York, 1993.
22. D.G. Pandelis and D. Teneketzis, Optimal sequencing in multiserver systems, Probab Engrg Inform Sci 10 (1996), 377-396.
23. D.G. Pandelis and D. Teneketzis, On the optimality of the Gittins index rule for multi-armed bandits with multiple plays, Math Methods Oper Res 50 (1999), 449-461.
24. M. Pinedo, Scheduling: Theory, algorithms, and systems, 2nd edition, Prentice Hall, Englewood Cliffs, NJ, 2002.
25. V.S. Tanaev, Y.N. Sotskov, and V.A. Strusevich, Scheduling theory, multi-stage systems, Kluwer Academic, Dordrecht, 1994.
26. M.P. Van Oyen, E.S. Gel, and W.J. Hopp, Performance opportunity for workforce agility in collaborative and noncollaborative work systems, IIE Trans 33 (2001), 761-777.
27. R.R. Weber, P. Varaiya, and J. Walrand, Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime, J Appl Probab 23 (1986), 841-847.
28. G. Weiss, Approximation results in parallel machines stochastic scheduling, Ann Oper Res 26 (1990), 195-242.
29. G. Weiss, On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines, Adv Appl Probab 27 (1995), 821-839.
30. G. Weiss and M. Pinedo, Scheduling tasks with exponential service times on nonidentical processors to minimize various cost functions, J Appl Probab 17 (1980), 187-202.
31. X. Zhou and X. Cai, (1997). General stochastic single-machine scheduling with regular cost functions, Math Comput Modelling 26 (1997), 95-108.