Abstract
This chapter discusses some other scheduling problems and models that do not fall into the categories presented in Chapters 2–9. Section 10.1 considers the problem to minimize a random variable of performance measure under stochastic order, which produces stronger results than the common approach of minimizing the expected value of the measure. Section 10.2 introduces the concept of “team-work tasks”, in which each job is processed by a team of different processors working on designated components of the job, and derives a number of corresponding optimal scheduling policies.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Alidaee, B., & Womer, N. K. (1999). Scheduling with time dependent processing times: Review and extensions. Journal of the Operational Research Society, 50, 711–720.
Amoura, A. K., Bampis, E., Kenyon, C., & Manoussakis, Y. (2002). Scheduling independent multiprocessor tasks. Algorithmica, 32, 247–261.
Arbib, C., Pacciarelli, D., & Smriglio, S. (1999). A three-dimensional matching model for perishable production scheduling. Discrete Applied Mathematics, 92, 1–15.
Bachman, A., Janiak, A., & Kovalyov, M. Y. (2002). Minimizing the total weighted completion time of deteriorating jobs. Information Processing Letters, 81, 81–84.
Bianco, L., Blazewicz, J., Dell’Olmo, P., & Drozdowski, M. (1995). Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors. Annals of Operations Research, 58, 493–517.
Blackburn, J., & Scudder, G. (2009). Supply chain strategies for perishable products: The case of fresh produce. Production and Operations Management, 18, 129–137.
Blazewicz, J., Ecker, K., Schmidt, G., & Weglarz, J. (1993). Scheduling in computer and manufacturing systems. Berlin: Springer.
Blazewicz, J., Drozdowski, M., & Weglarz, J. (1994). Scheduling multiprocessor tasks – A survey. Microcomputer Applications, 13, 89–97.
Boxma, O. J., & Forst, F. G. (1986). Minimizing the expected weighted number of tardy jobs in stochastic flow shops. Operations Research Letters, 5, 119–126.
Brown, M., & Solomon, H. (1973). Optimal issuing policies under stochastic field lives. Journal of Applied Probability, 10, 761–768.
Browne, S., & Yechiali, U. (1989). Dynamic priority rules for cyclic type queues. Advances in Applied Probability, 10, 432–450.
Browne, S., & Yechiali, U. (1990). Scheduling deteriorating jobs on a single processor. Operations Research, 38, 495–498.
Cai, X.Q.i, & Zhou, X. (1999). Stochastic scheduling on parallel machine subject to random breakdowns to minimize expected costs for earliness and tardy cost. Operations Research, 47, 422–437.
Cai, X.Q.i, & Zhou, X. (2005). Single-machine scheduling with exponential processing times and general stochastic cost functions. Journal of Global Optimization, 31, 317–332.
Cai, X.Q.i, & Zhou, X. (2013, to appear). Optimal policies for perishable products when transportation to export market is disrupted. Production and Operations Management. doi: 10.111/poms.12080.
Cai, X. Q., & Zhou, X. (2004). Deterministic and stochastic scheduling with team-work tasks. Naval Research Logistics, 51, 818–840.
Cai, X. Q., Lee, C.-Y., & Li, C. L. (1998). Minimizing total flow time in two-processor task systems with prespecified processor allocations. Naval Research Logistics, 45, 231–242
Cai, X. Q., Lee, C.-Y., & Wong, T. L. (2000). Multi-processor task scheduling to minimize the maximum tardiness and the total completion time. IEEE Transactions on Robotics and Automation, 16, 824–830.
Chang, C., & Yao, D. (1993). Rearrangement, majorization and stochastic scheduling. Mathmatics of Operations Research, 18(3), 658–684.
Chopra, S., & Meindl, P. (2001). Supply chain management: Strategy, planning, and operation. Upper Saddle River: Prentice Hall.
Cooper, W. L. (2001). Pathwise properties and performance bounds for a perishable inventory system. Operations Research, 49, 455–466.
Drozdowski, M. (1996). Scheduling multiprocessor tasks – An overview. European Journal of Operational Research, 94, 215–230.
Fawcett, P., Mcleish, R., & Ogden, I. (1992). Logistics management. Harlow: Prentice Hall.
Ferguson, M., & Koenigsberg, O. (2007). How should a firm manage deteriorating inventory? Production and Operations Management, 16, 306–321.
Gehringer, E. F., Siewiorek, D. P., & Segall, Z. (1987). Parallel processing: The Cm ∗ experience. Bedford: Digital Press.
Goyal, S. K., & Giri, B. C. (2001). Recent trends in modeling of deteriorating inventory. European Journal of Operational Research, 134, 1–16.
Hall, N. G., & Potts, C. N. (2004). Rescheduling for new orders. Operations Research, 52, 440–453.
Herrmann, J. W. (2006). Rescheduling strategies, policies, and methods. In J. W. Herrmann (Ed.), Handbook of production scheduling (pp. 135–148). New York: Springer.
Hoogeveen, H., Lente, C., & T’kindt, V. (2012). Rescheduling for new orders on a single machine with setup times. European Journal of Operational Research, 223, 40–46.
Hopkins, A. L., Smith, T. B., III & Lala, J. H. (1978). FTMP – A highly reliable fault-tolerant multiprocessor for aircraft. Proceedings of the IEEE, 66(10), 1221–1239.
Hsu, V. N. (2000). Dynamic economic lot size model with perishable inventory. Management Science, 46, 1159–1169.
Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness (Research Report 43). Management Science Research Project, UCLA.
Krawczyk, H., & Kubale, M. (1985). An approximation algorithm for diagnostic test scheduling in multi-computer systems. IEEE Transactions on Computers, 34, 869–872.
Kuo, W., Chien, W. T. K., & Kim, T. (1998). Reliability, yield, and stress burn-in. Boston: Kluwer.
Liskyla-Peuralahti, J., Spies, M., & Tapaninen, U. (2011). Transport vulnerabilities and critical industries: Experiences from a Finnish stevedore strike. International Journal of Risk Assessment and Management, 15, 222–240.
Mosheiov, G. (1991). V-shaped policies for scheduling deteriorating jobs. Operations Research, 39, 979–991.
Nahmias, S. (1982). Perishable inventory theory: A review. Operations Research, 30, 680–708.
Nandakumar, P., & Morton, T. E. (1993). Near myopic heuristics for the fixed-life perishability problem. Management Science, 39, 1490–1498.
Pinedo, M. (1983). Stochastic scheduling with release dates and due dates. Operations Research, 31, 559–572.
Pinedo, M. (2002). Scheduling: Theory, algorithms, and systems (2nd ed.). Englewood Cliffs: Prentice Hall.
Raafat, F. (1991). Survey of literature on continuously deteriorating inventory models. Journal of the Operational Research Society, 42, 27–37.
Sarin, S. C., Erel, E., & Steiner, G. (1991). Sequencing jobs on a single machine with a common due date and stochastic processing times. European Journal of Operational Research, 51, 287–302.
Shaked, M., & Shanthikumar, J. G. (1994). Stochastic orders and their applications. Boston: Academic.
Shanthikumar, J. G., & Yao, D. D. (1991). Bivariate characterization of some stochastic order relations. Advances in Applied Probability, 23, 642–659.
Snyder, L. V., Atan, Z., Peng, P., Rong, Y., Schmitt, A. J., & Sinsoysal, B. (2010, submitted). OR/MS models for supply chain disruptions: A review. Social Science Research Network. http://dx.doi.org/10.2139/ssrn.1689882.
Starbird, S. A. (1988). Optimal loading sequences for fresh-apple storage facilities. Operations Research, 39, 911–917.
Stevenson, W. J. (2009). Operations management (10th ed.). New York: McGraw-Hill.
Tadei, R., Trubian, M., Avendano, J. L., DellaCroce, F., & Menga, G. (1995). Aggregate planning and scheduling in the food industry: A case study. European Journal of Operational Research, 87, 564–573.
Vakharia, A. J., & Yenipazarli, A. (2009). Managing supply chain disruptions. Foundations and Trends in Technology, Information and Operations Management, 2, 243–325.
Wilson, M. C. (2007). The impact of transportation disruptions on supply chain performance. Transportation Research Part E: Logistics and Transportation Review, 43, 295–320.
Zhao, C., & Tang, H. (2010). Rescheduling problems with deteriorating jobs under disruptions. Applied Mathematical Modelling, 34, 238–243.
Zhou, X., & Cai, X. Q. (1997). General stochastic single-machine scheduling with regular cost functions. Mathematical and Computer Modeling, 26, 95–108.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Cai, X., Wu, X., Zhou, X. (2014). More Stochastic Scheduling Models. In: Optimal Stochastic Scheduling. International Series in Operations Research & Management Science, vol 207. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7405-1_10
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7405-1_10
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-7404-4
Online ISBN: 978-1-4899-7405-1
eBook Packages: Business and EconomicsBusiness and Management (R0)