Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs

References

• Bruno J., Downey P. Complexity of task sequencing with deadlines, setup-times and changeover costs. SIAM J. Comput. (1978) 7:393–404Crossref, Google 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(4):477–486Link, Google Scholar
• Chesapeake Decision Sciences, Inc The CHES problems. (1989) . Technical report, Chesapeake Decision Sciences, Inc., New Province, NJGoogle Scholar
• CPLEX Optimization, IncUsing the CPLEX™ Callable Library and CPLEX™ Mixed Integer Library (1994) (Incline Village, Nevada) Google Scholar
• Dobson G. The cyclic lot scheduling problem with sequence-dependent setups. Oper. Res. (1992) 40:736–749Link, 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
• Fleischmann B., Meyr H. The general lotsizing and scheduling problem. OR Spektrum (1997) 19:11–21Crossref, Google Scholar
• Gallego G., Joneja D. Economic lot scheduling problem with raw material considerations. Oper. Res. (1994) 42:92–101Link, Google Scholar
• Haase K. Lotsizing and scheduling for production planning. Lecture Notes in Ec. and Math. Systems (1994) (Springer-Verlag)408Crossref, Google Scholar
• Haase K. Capacitated lotsizing with sequence dependent setup costs. OR Spektrum (1996) 18:51–59Crossref, Google Scholar
• Kang S.A Route-Splitting Approach to the Vehicle Routing Problem and a Lotsizing and Scheduling Problem with Sequence-Dependent Setup Costs (1994) (Ph.D. dissertation, Johnson Graduate School of Management, Cornell University, Ithaca, NY) Google Scholar
• Kang S., Malik K., Thomas L. J. A route-splitting approach to the vehicle routing problem. (1994) . JGSM Working paper, Cornell University, Ithaca, NYGoogle Scholar
• Lasdon L. S.Optimization Theory for Large Systems (1970) (MacMillan Inc., London) 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
• Thizy J. M., Van Wassenhove L. N. Lagrangean relaxation for the multi-item capacitated lot-sizing problem: A heuristic implementation. IIE Trans. (1985) 17(4):308–313Crossref, Google Scholar
• Trigeiro W. W., Thomas L. J., McClain J. O. Capacitated lot sizing with setup times. Management Sci. (1989) 35(3):353–366Link, Google Scholar