Discrete Lotsizing and Scheduling by Batch Sequencing

References

• Ahn B. H., Hyun J. H. Single facility multi-class job scheduling. Comput. Oper. Res. (1990) 17:265–272Crossref, Google Scholar
• Bruno J., Downey P. Complexity of task sequencing with deadlines, setup-times and changeover costs. SIAM J. Comput. (1978) 7:393–404Crossref, Google Scholar
• Brüggemann W., Jahnke H. Remarks on: “Some extensions of the discrete lotsizing and scheduling problem.”. (1994) . Working paper, Institut für Logistik and Transport, University of Hamburg, GermanyGoogle Scholar
• Cattrysse D., Salomon M., Kuik R., van Wassenhove L. N. A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup-times. Management Sci. (1993) 39:477–486Link, Google Scholar
• Drexl A., Kimms A. Lot sizing and scheduling: Survey and extensions. Eur. J. Oper. Res. (1997) 99:221–235Crossref, Google Scholar
• Dumas Y., Desrosiers J., Gelinas E., Solomon M. M. Technical note: An optimal algorithm for the traveling salesman problem with time windows. Oper. Res. (1995) 43:367–371Link, Google Scholar
• Fleischmann B. The discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. (1990) 44:337–348Crossref, Google Scholar
• Fleischmann B. The discrete lot-sizing and scheduling problem with sequence-dependent setup-costs. Eur. J. Oper. Res. (1994) 75:395–404Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability—A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco, CA) Google Scholar
• Haase K. Capacitated lot-sizing with sequence dependent setup costs. OR Spektrum (1996) 18:51–59Crossref, Google Scholar
• Haase K., Kimms A. Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities. (1996) . Working paper, University of Kiel, GermanyGoogle Scholar
• Jordan C.Batching and Scheduling—Models and Methods for Several Problem Classes (1996) (Lecture Notes in Economics and Math. Systems No. 437, Springer Berlin) Crossref, Google Scholar
• Jordan C., Drexl A. Discrete lotsizing and scheduling by batch sequencing. (1997) . Working paper no. 438, University of Kiel, GermanyGoogle Scholar
• Lasdon L. S., Terjung R. C. An efficient algorithm for multi-item scheduling. Oper. Res. (1971) 19:946–969Link, Google Scholar
• Mason A. J., Anderson E. J. Minimizing flow time on a single machine with job classes and setup times. Naval Res. Logist. (1991) 38:333–350Crossref, Google Scholar
• Monma C. L., Potts C. N. On the complexity of scheduling with batch setup-times. Oper. Res. (1989) 37:798–804Link, Google Scholar
• Potts C. N., van Wassenhove L. N. Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. J. Oper. Res. Soc. (1992) 43:395–406Crossref, Google Scholar
• Salomon M., Kroon L. G., Kuik R., van Wassenhove L. N. Some extensions of the discrete lotsizing and scheduling problem. Management Sci. (1991) 37:801–812Link, Google Scholar
• Salomon M., Solomon M. M., van Wassenhove L. N., Dumas Y. D., Dauzere-Peres S. Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows. Eur. J. Oper. Res. (1997) 100:494–513Crossref, Google Scholar
• Santos C., Magazine M. Batching in single operation manufacturing systems. Oper. Res. Lett. (1985) 4:99–103Crossref, Google Scholar
• Schutten J. M. J., van de Velde S. L., Zijm W. H. M. Single-machine scheduling with release dates, due dates, and family setup times. Management Sci. (1996) 42:1165–1174Link, Google Scholar
• Unal A., Kiran A. S. Batch sequencing. IIE Trans. (1992) 24:73–83Crossref, Google Scholar
• Vickson R. G., Magazine M., Santos C. Batching and sequencing of components at a single facility. IIE Trans. (1993) 25:65–70Crossref, Google Scholar
• Wagner H. M., Whitin T. M. Dynamic version of the economic lot size model. Management Sci. (1958) 5:89–96Link, Google Scholar
• Webster S., Baker K. R. Scheduling groups of jobs on a single machine. Oper. Res. (1995) 43:692–704Link, Google Scholar