Properties of Optimal-Weighted Flowtime Policies with a Makespan Constraint and Set-up Times

References

• Ahn B., Hyun J. Single facility multi-class job scheduling;. Computers Opns. Res. (1990) 17(3):265–272Crossref, Google Scholar
• Asawa M., Teneketzis D. Multi-armed Bandits with Switching Penalties. IEEE Trans. Automatic Control (1996) 41(3):328–348Crossref, Google Scholar
• Baker K. R.Elements of Sequencing and Scheduling (1993) (Dartmouth College, Hanover, NH) Google Scholar
• Bertsekas D. P.Dynamic Programming: Deterministic and Stochastic Models (1987) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Bruno J., Sethi R. Task sequencing in a batch environment with setuptimes. Found. Control Engin. (1987) 3:105–117Google Scholar
• Duenyas I., M. P. Van Oyen. Heuristic scheduling of parallel heterogeneous queues with set-ups. Management Sci. (1996) 42:6:814–829Link, Google Scholar
• Gittins J. C.Multi-armed Bandit Allocation Indices (1989) (Wiley, New York) Google Scholar
• Ham I., Hitomi K., Yoshida T.Group Technology: Application to Production Management (1985) (Kluwer-Nijhoff Publishing, Boston) Crossref, Google Scholar
• Ishikida T., Varaiya P. Multi-armed bandit problem revisited. J. Opt. Theory Appl. (1994) 83:113–154Crossref, Google Scholar
• Mason A. J., Anderson E. J. Minimizing flow time on a single machine with job classes and setuptimes. Naval Res. Logist. (1991) 38:333–350Crossref, Google Scholar
• Monma C. L., Potts C. N. On the complexity of scheduling with batch setuptimes. Oper. Res. (1989) 37:798–804Link, Google Scholar
• Morton T. E., Pentico D. W.Heuristic Scheduling Systems (1993) (Wiley, New York) Google Scholar
• Potts C. N., Van Wassenhove L. W. Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. J. Oper. Res. Soc. (1992) 43:395–406Crossref, Google Scholar
• Ross S. M.Introduction to Stochastic Dynamic Programming (1983) (Academic Press, New York) Google Scholar
• Santos C., Magazine M. Batching in single operation manufacturing system. Oper. Res. Letters (1985) 4:3):99–103Crossref, Google Scholar
• Van Oyen M. P., Duenyas I., Tsai C.-Y. Stochastic sequencing with job families, set-up times, and due dates. Int'l. J. Systems Sci. (1998) Google Scholar
• Van Oyen M. P., Pandelis D. G., Teneketzis D. Optimality of index policies for stochastic scheduling with switching penalties. J. Appl. Probab. (1992) 29:957–966Crossref, Google Scholar
• Van Oyen M. P., Senturk-Gel E., Hopp W. J. Performance opportunity for flexible workers. Proc. Thirty-Fifth Annual Allerton Conference on Comm., Control, and Computing (1997) . 10 pagesGoogle Scholar
• Van Oyen M. P., Teneketzis D. Optimal stochastic scheduling of forest networks with switching penalties. Adv. Appl. Probab. (1994) 26:474–497Crossref, Google Scholar
• Varaiya P., Walrand J., Buyukkoc C. Extensions of the multiarmed bandit problem. IEEE Trans. Automatic Control (1985) 426–439AC-30Crossref, Google Scholar
• Webster S., Baker K. R. Scheduling groups of jobs on a single machine. Oper. Res. (1994) 43:692–703Link, Google Scholar