Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints

References

  • Balinski M., Shahidi N. A simple approach to the product rate variation problem via axiomatics. Oper. Res. Letters (1998) 22:129–135CrossrefGoogle Scholar
  • Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for huge integer programs. Oper. Res. (1998) 46:316–329LinkGoogle Scholar
  • Bixby N., Boyd E.Using the CPLEX Callable Library (1996) (CPLEX Optimization Inc., Houston, TX) Google Scholar
  • Bradley S. P., Hax A. C., Magnanti T. L.Applied Mathematical Programming (1977) (Addison-Wesley, Reading)Google Scholar
  • Dincbas M., Simonis H., van Hentenryck P. Solving the car-sequencing problem in constraint logic programming. (1988) Proceedings of the European Conference on Artificial Intelligence (ECAI-88)(München)290–295Google Scholar
  • Drexl A., Jordan C. MaterialfluBorientierte Produktionssteuerung bei VariantenflieBfertigung. Zeitschrift für betriebswirtschaftliche Forschung (1995) 47:1073–1087Google Scholar
  • Inman R. R., Bulfin R. L. Sequencing JIT mixed-model assembly lines. Management Sci. (1991) 37:901–904LinkGoogle Scholar
  • Kubiak W. Minimizing variation of production rates in just-in-time systems: A survey. European J. Oper. Res. (1993) 66:259–271CrossrefGoogle Scholar
  • Kubiak W., Sethi S. A note on ‘Level schedules for mixed-model assembly lines in just-in-time production systems’. Management Sci. (1991) 37:121–122LinkGoogle Scholar
  • Matthiessen L., Drexl A., Kimms A.Constraint propagation algorithms for the car sequencing problem (2000) (Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universitüt Kiel)Google Scholar
  • Miltenburg G. J. Level schedules for mixed-model assembly lines in just-in-time production systems. Management Sci. (1989) 35:192–207LinkGoogle Scholar
  • Miltenburg G. J., Goldstein T. Developing production schedules which balance part usage and smooth production loads for just-intime production systems. Naval Res. Logistics (1991) 38:893–910CrossrefGoogle Scholar
  • Miltenburg G. J., Steiner G., Yeomans J. S. A dynamic programming algorithm for scheduling mixed-model, just-in-time production systems. Math. and Comput. Modelling (1990) 13(3):57–66CrossrefGoogle Scholar
  • Parello B. D. CAR WARS: The (almost) birth of an expert system. AI Expert (1988) 3:60–64Google Scholar
  • Parello B. D., Kabat W. C., Wos L. Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem. J. Automated Reasoning (1986) 2:1–42Google Scholar
  • Scholl A.Balancing and Sequencing of Assembly Lines (1999) 2nd edition(Physica, Heidelberg, Germany)CrossrefGoogle Scholar
  • Soumis F., Dell'Amico M., Maffioli F., Martello S. Decomposition and column generation. Annotated Bibliographies in Combinatorial Optimization (1997) (John Wiley … Sons, New York) 115–126Google Scholar
  • Steiner G., Yeomans J. S. Level schedules for mixed-model, just-in-time processes. Management Sci. (1993) 39:728–735LinkGoogle Scholar
  • Tsai L.-H. Mixed-model sequencing to minimize utility work and the risk of conveyor stopping. Management Sci. (1995) 41:485–495LinkGoogle Scholar
  • Vanderbeck F., Wolsey L. A. An exact algorithm for IP column generation. Oper. Res. Letters (1996) 19:151–160CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.