Solving the car sequencing problem via Branch & Bound
In a mixed-model assembly line, varying models of the same basic product are to be produced in a facultative sequence. This results to a short-term planning problem where a sequence of models is sought which minimizes station overloads. In practice - e.g. the final assembly of cars - special sequencing rules are enforced which restrict the number of models possessing a certain optional feature k to rk within a subsequence of sk successive models. This problem is known as car sequencing. So far, employed solution techniques stem mainly from the field of Logic and Constraint Logic Programming. In this work, a special Branch & Bound algorithm is developed, which exploits the problem structure in order to reduce combinatorial complexity.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Scholl, Armin, 1995.
"Balancing and sequencing of assembly lines,"
Publications of Darmstadt Technical University, Institute for Business Studies (BWL)
9690, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
- Scholl, Armin, 1999. "Balancing and sequencing of assembly lines," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 10881, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
- Andreas Drexl & Alf Kimms, 2001. "Sequencing JIT Mixed-Model Assembly Lines Under Station-Load and Part-Usage Constraints," Management Science, INFORMS, vol. 47(3), pages 480-491, March.
- Armin Scholl & Christian Becker, 2003.
"A survey on problems and methods in generalized assembly line balancing,"
Jenaer Schriften zur Wirtschaftswissenschaft
21/2003, Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät.
- Becker, Christian & Scholl, Armin, 2006. "A survey on problems and methods in generalized assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 694-715, February.
- Gagne, Caroline & Gravel, Marc & Price, Wilson L., 2006. "Solving real car sequencing problems with ant colony optimization," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1427-1448, November.
- Robert R. Inman & Robert L. Bulfin, 1991. "Note---Sequencing JIT Mixed-Model Assembly Lines," Management Science, INFORMS, vol. 37(7), pages 901-904, July.
- Steiner, George & Yeomans, Julian Scott, 1996. "Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging," European Journal of Operational Research, Elsevier, vol. 95(1), pages 38-52, November.
- Kubiak, Wieslaw, 1993. "Minimizing variation of production rates in just-in-time systems: A survey," European Journal of Operational Research, Elsevier, vol. 66(3), pages 259-271, May.
- Nick T. Thomopoulos, 1967. "Line Balancing-Sequencing for Mixed-Model Assembly," Management Science, INFORMS, vol. 14(2), pages 59-75, October.
- John Miltenburg, 1989. "Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems," Management Science, INFORMS, vol. 35(2), pages 192-207, February.
- George Steiner & Scott Yeomans, 1993. "Level Schedules for Mixed-Model, Just-in-Time Processes," Management Science, INFORMS, vol. 39(6), pages 728-735, June.
- Li-Hui Tsai, 1995. "Mixed-Model Sequencing to Minimize Utility Work and the Risk of Conveyor Stoppage," Management Science, INFORMS, vol. 41(3), pages 485-495, March.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:191:y:2008:i:3:p:1023-1042. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.