Backup strategy for robots' failures in an automotive assembly system
Automotive assembly lines are often characterized by robots' failures that may result in stoppages of the lines and manual backup of tasks. The phenomena tend to impair throughput rate and products' quality. This paper presents a backup strategy in which working robots perform tasks of failed robots. The proposed Mixed-Integer Linear-Programming based approach minimizes the throughput loss by utilizing the robots' redundancy in the system. Two algorithms are developed to comply with stochastic conditions of a real-world environment. The performance of these algorithms is compared with several heuristics, and the downstream-backup based algorithm is found superior to all other methods.
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.:
- Nils Boysen & Malte Fliedner & Armin Scholl, 2006.
"Assembly line balancing: Which model to use when?,"
Jenaer Schriften zur Wirtschaftswissenschaft
23/2006, Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät.
- Scholl, Armin & Becker, Christian, 2006.
"State-of-the-art exact and heuristic solution procedures for simple assembly line balancing,"
European Journal of Operational Research,
Elsevier, vol. 168(3), pages 666-693, February.
- Armin Scholl & Christian Becker, 2003. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," Jenaer Schriften zur Wirtschaftswissenschaft 20/2003, Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät.
- Matthias Amen, 2003.
"Heuristic methods for cost-oriented assembly line balancing: a survey,"
GE, Growth, Math methods
0309003, EconWPA, revised 09 Sep 2003.
- Amen, Matthias, 2000. "Heuristic methods for cost-oriented assembly line balancing: A survey," International Journal of Production Economics, Elsevier, vol. 68(1), pages 1-14, October.
- 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.
- 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.
When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:120:y:2009:i:2:p:315-326. 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: (Zhang, Lei)
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.