Bibliography
Published online by Cambridge University Press: 05 July 2014
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Stochastic SchedulingExpectation-Variance Analysis of a Schedule, pp. 183 - 186Publisher: Cambridge University PressPrint publication year: 2010
References
, and 2001. “On computing the distribution function of the sum of independent random variables.” Computers and Operations Research 28(5):473–483.CrossRefGoogle Scholar
, and 2000. “Scheduling of multiclass single server queues under nontraditional performance measures.” Operations Research 48(3):482–489.CrossRefGoogle Scholar
1961. “The greatest of a finite set of random variables.” Operations Research 9:145–162.CrossRefGoogle Scholar
, and 1990. “Multiobjective flow-shop scheduling.” Naval Research Logistics 37:981–995.3.0.CO;2-H>CrossRefGoogle Scholar
, and 1995. “Robust scheduling to hedge against processing time uncertainty in single-stage production.” Management Science 41(2):363–376.CrossRefGoogle Scholar
, and E. 1997. “β-Robust scheduling for single-machine systems with uncertain processing times.” IIE Transactions 29:977–985.CrossRefGoogle Scholar
, , and 1999. “CONWIP-based production lines with multiple bottlenecks: Performance and design implications.” IIE Transactions 31:99–111.Google Scholar
, , and 1992. “Expectation-variance analysis of job sequences under processing time uncertainty.” International Journal of Production Economics 28:289–297.CrossRefGoogle Scholar
, , and 1977. “Maximum likelihood from incomplete data via the EM algorithm.” Journal of the Royal Statistical Society, Series B (Methodological) 39(1):1–38.Google Scholar
1980. “Media selection by mean-variance analysis.” European Journal ofOperational Research 5:112–117.Google Scholar
, and 1984. “Media selection by mean-variance analysis.” European Journal of Operational Research 16:152–156.CrossRefGoogle Scholar
1985. “Approximating the distribution function in stochastic networks.” Computers and Operations Research 12(3):251–264.CrossRefGoogle Scholar
1996. “Determining the optimal sequences and the distributional properties of the completion times in stochastic flow shops.” Computers and Operations Research 23:829–843.CrossRefGoogle Scholar
, , and 1993. “Characterizing the output process of a CONWIP line with deterministic processing and random outages.” Management Science 39:975–988.CrossRefGoogle Scholar
1977. Activity Networks: Project Planning and Control by Network Models. New York: Wiley.Google Scholar
1995. “Bicriteria stochastic scheduling on one or more machines.” European Journal of Operational Research 80:404–109.CrossRefGoogle Scholar
1975. “Surrogate constraint duality in mathematical programming.” Operations Research 23:434–453.CrossRefGoogle Scholar
, and 1962. “A dynamic programming approach to sequencing problems.” The Japan Society for Industrial and Applied Mathematics (SIAM) 10:196–210.Google Scholar
1992. “The output processes of serial production lines of exponential machines with finite buffers.” Operations Research 40(6):1139–1147.CrossRefGoogle Scholar
1954. “Optimal two- and three-stage production schedules with setup times included.” Naval Research Logistics Quarterly 1:61–67.CrossRefGoogle Scholar
, , and 1990. “Bicriteria single-stage scheduling to minimize both the expected value and the variance of the total flow time.” Journal of Japan Industrial Management Association 39:76-82 (in Japanese).Google Scholar
, , and 2000. “Robust scheduling of a two-machine flow shop with uncertain processing times.” IIE Transactions 32:421–432.CrossRefGoogle Scholar
, and 1994. “Fluctuation smoothing policies are stable for stochastic reentrant lines.” In: 33rd IEEE Proceedings Conference on Decision and Control, December, pp. 1476-1480.Google Scholar
, and 1995. “Single-machine stochastic scheduling with dual criteria.” IIE Transactions 27:244–249.CrossRefGoogle Scholar
1983. “Hybrid algorithm for sequencing with bicriteria.” Journal of Optimization Theory and Applications 39(1):105–124.CrossRefGoogle Scholar
, , and 1992. “Multi objective discounted Markov decision processes with expectation and variance criteria.” International Journal of Systems Science 23(6):903–914.CrossRefGoogle Scholar
, , and 1994. “Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants.” IEEE Transactions on Semiconductor Manufacturing 7(3):374–385.CrossRefGoogle Scholar
, 1986. “Resource-constrained assignment scheduling.” Operations Research 34:560–572.CrossRefGoogle Scholar
, , and 1988. “Job-shop scheduling theory: What is relevant?” Interfaces 18:84–90.CrossRefGoogle Scholar
, , , and 1993. “An interactive approach for searching a preferred schedule.” Journal of Japan Industrial Management Association 39:76–82.Google Scholar
, , and 1996. “Multi objective genetic algorithm and its applications to flowshop scheduling.” Computers and Industrial Engineering 30:957–968.Google Scholar
, and 1997. “Interactive decision system in parallel-machine stochastic multi-objective scheduling.” In: Proceedings of the 1st International Conference on Engineering Design and Automation, Bangkok, Thailand, pp. 421-424.Google Scholar
, and 1998. “Interactive decision system in stochastic multi-objective scheduling to minimize the expected value and variance of total flow time.” Journal of the Operations Research Society of Japan 41(2):261–278.CrossRefGoogle Scholar
, , and 1986. “Scheduling with multiple performance measures: The one-machine case.” Management Science 32(4):464–479.CrossRefGoogle Scholar
2002. Scheduling: Theory, Algorithms, and Systems, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar
, and 1998. “Makespan related criteria for comparing schedules in stochastic environments.” The Journal of the Operational Research Society. 49(11):1188–1195.CrossRefGoogle Scholar
1995. “Heuristics for scheduling in flowshop with multiple objectives.” European Journal of Operational Research 82:540–555.CrossRefGoogle Scholar
2007. “Kullback-Leibler approach to Gaussian mixture reduction.” IEEE Transactions on Aerospace and Electronic Systems 43(3):989–999.CrossRefGoogle Scholar
1988. “Mixture reduction algorithms for uncertainty tracking.” Technical Report 88004. Royal Aerospace Establishment, Farnborough, England.Google Scholar
, and 2000. “A two machine bicriteria scheduling problem.” International Journal of Production Economics 65:125–139.CrossRefGoogle Scholar
, and 2004. “Equal processing time bicriteria scheduling on parallel machines.” Journal of Combinatorial Optimization 8:227–240.CrossRefGoogle Scholar
1983. “The completion time of PERT networks.” Journal ofthe Operational Research Society 34(2):155–158.Google Scholar
, and 2001. “Risk-sensitive decision theoretic diagnosis.” IEEE Transactions on Automatic Control 46(7):1167–1171.CrossRefGoogle Scholar
, and 1997. “Interactive decision support system in stochastic multi-objective scheduling.” Bulletin of Osaka Prefecture University, Series A, 45(2):133-142.Google Scholar
, and 1999. “Interactive decision support system in stochastic multi-objective portfolio selection.” International Journal ofProduction Economics 60-61:187-193.Google Scholar
1977. “Bounding distributions for a stochastic PERT network.” Networks 7(4):359-381.CrossRefGoogle Scholar
, and 1991. “Throughput of a constant work in process manufacturing line subject to failures.” International Journal of Production Research 29:635–655.Google Scholar
, , and 1980. “CONWIP: A pull alternative to kanban.” International Journal ofProduction Research 28(5):879–894.Google Scholar
1994. “The most criticalpath in a PERT network: A heuristic approach.” European Journal of Operational Research 78(1):93–105.CrossRefGoogle Scholar
, and 1984. “The stochastic single machine scheduling problem with earliness and tardiness costs.” European Journal ofOperational Research 77:187–302.Google Scholar
, and 1993. “Determination of part-delivery dates in a small lot stochastic assembly system.” Opsearch 30(4):281–312.Google Scholar
1997. “Variance of the throughput of an n-station production line with no intermediate buffers and time dependent failures.” European Journal of Operational Research 101:560–576.CrossRefGoogle Scholar
2000. “Asymptotic variance rate of the output in production lines with finite buffers.” Annals ofOperations Research 93:385–403.Google Scholar
, and 2005. “Special issue on multi-criteria scheduling.” European Journal of Operations Research 167:796–809.Google Scholar
1996. “Rates of convergence for the maximum likelihood estimator in mixture models.” Journal Nonparametric Statistics 6:293–310.CrossRefGoogle Scholar
2004. “Asymptotic theory for maximum likelihood in nonparametric mixture models.” Computational Statistics & Data Analysis 41:453–464.Google Scholar
, and 2005. “Multivariate normal distribution based statistical timing analysis using global projection and local expansion.” In: Proceedings of the 18th International Conference on VLSI Design, pp. 380-385.Google Scholar
, and 1980. “Solving a bi-criteria scheduling problem.” European Journal of Operational Research 4(1):42–48.Google Scholar
1986. “A model to approximate transient performance of the flowshop.” International Journal of Production Research 24(1):33–50.CrossRefGoogle Scholar
1986. “The application of lognormal models of transient operations in the flexible manufacturing environment.” Journal of Manufacturing Systems 5(4): 253-266.CrossRefGoogle Scholar
, and 1982. “A methodology to describe operating characteristics of assembly systems.” IIE Transactions 14(3):204–214.CrossRefGoogle Scholar
2005. “Gaussian mixture reduction for tracking multiple maneuvering targets in clutter.” Ph.D. thesis, Air Force Institute of Technology, Ohio.Google Scholar
1983. “On the convergence properties of the EM algorithm.” Annals of Statistics 11:55–103.CrossRefGoogle Scholar
, and 2002. “On the robust single machine scheduling problem.” Journal of Combinatorial Optimization 6:17–33.CrossRefGoogle Scholar
, and 2007. “A new approximation algorithm for obtaining the probability distribution function for project completion time.” Computers and Mathematics with Applications 54(2):282–295.CrossRefGoogle Scholar