Operations and Shipment Scheduling of a Batch on a Flexible Machine

References

• Bendor-Samuel P., Staedke J.Turning Lead into Gold: The Demystification of Outsourcing (2000) (Executive Excellence Publishing, Provo, UT) Google Scholar
• Benkherouf L., Glazebrook K. D., Owen W. Single-visit polices for allocating a single resource in a stochastic environment. Oper. Res. (1994) 42:1087–1099Link, Google Scholar
• Duenyas I., Gupta D., Lennon T. M. Control of a single-server tandem queueing system with setups. Oper. Res. (1998) 46:218–230Link, Google Scholar
• Glazebrook K. D. On stochastic scheduling with precedence relations and switching costs. J. Appl. Probab. (1980) 17:1016–1024Crossref, Google Scholar
• Glazebrook K. D. A suboptimality bound for permutation policies in single machine stochastic scheduling. Naval Res. Logist. (1995) 42:993–1006Crossref, Google Scholar
• Hopp W. J., Spearman M. L.Factory Physics (2001) (Irwin/McGraw-Hill, New York) Google Scholar
• Iravani S. M. R., Posner M. J. M., Buzacott J. A. A two-stage tandem queue attended by a moving server with holding and switching costs. Queueing Systems (1997) 26:203–228Crossref, Google Scholar
• Sidney J. B. Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Oper. Res. (1975) 23:283–298Link, Google Scholar
• Tocchet M.A Case-Study Guide to Business Process Outsourcing (1998) (Kpmg Peat Marwick Llp & G2R. Inc.). Financial Executives Res. FoundGoogle Scholar
• Trucks H. E.Designing for Economical Production (1987) (Society of Manufacturing Engineers, Dearborn, MI) Google 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