Combinatorial design of a minimum cost transfer line
The problem of equipment selection for a production line is considered. Each piece of equipment, also called unit or block, performs a set of operations. All necessary operations of the line and all available blocks with their costs are known. The difficulty is to choose the most appropriate blocks and group them into (work)stations. There are some constraints that restrict the assignment of different blocks to the same station. Two combinatorial approaches for solving this problem are suggested. Both are based on a novel concept of locally feasible stations. The first approach combinatorially enumerates all feasible solutions, and the second reduces the problem to search for a maximum weight clique. A boolean linear program based on a set packing formulation is presented. Computer experiments with benchmark data are described. Their results show that the set packing model is competitive and can be used to solve real-life problems.
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.
Volume (Year): 40 (2012)
Issue (Month): 1 (January)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
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.:
- Guschinskaya, Olga & Dolgui, Alexandre, 2009. "Comparison of exact and heuristic methods for a transfer line balancing problem," International Journal of Production Economics, Elsevier, vol. 120(2), pages 276-286, August.
- Corominas, Albert & Pastor, Rafael & Plans, Joan, 2008. "Balancing assembly line with skilled and unskilled workers," Omega, Elsevier, vol. 36(6), pages 1126-1132, December.
- 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.
- Ribas, Imma & Companys, Ramon & Tort-Martorell, Xavier, 2011. "An iterated greedy algorithm for the flowshop scheduling problem with blocking," Omega, Elsevier, vol. 39(3), pages 293-301, June.
- Dolgui, Alexandre & Guschinsky, Nikolai & Levin, Genrikh, 2006. "A special case of transfer lines balancing by graph approach," European Journal of Operational Research, Elsevier, vol. 168(3), pages 732-746, February.
- Dolgui, A. & Ihnatsenka, I., 2009. "Branch and bound algorithm for a transfer line design problem: Stations with sequentially activated multi-spindle heads," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1119-1132, September.
- Dolgui, A. & Guschinsky, N. & Levin, G. & Proth, J.-M., 2008. "Optimisation of multi-position machines and transfer lines," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1375-1389, March.
- Ronconi, Débora P. & Henriques, Luís R.S., 2009. "Some heuristic algorithms for total tardiness minimization in a flowshop with blocking," Omega, Elsevier, vol. 37(2), pages 272-281, April.
- Gagnon, R. J. & Ghosh, S., 1991. "Assembly line research: Historical roots, research life cycles and future directions," Omega, Elsevier, vol. 19(5), pages 381-399.
- Scholl, Armin & Voß, Stefan, 1994. "Simple assembly line balancing : heuristic approaches," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 49132, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
- Sawik, Tadeusz, 2010. "An integer programming approach to scheduling in a contaminated area," Omega, Elsevier, vol. 38(3-4), pages 179-191, June.
- Sarin, Subhash C. & Erel, Erdal & Dar-El, Ezey M., 1999. "A methodology for solving single-model, stochastic assembly line balancing problem," Omega, Elsevier, vol. 27(5), pages 525-535, October.
- Ruiz-Torres, Alex J. & Ho, Johnny C. & Ablanedo-Rosas, José H., 2011. "Makespan and workstation utilization minimization in a flowshop with operations flexibility," Omega, Elsevier, vol. 39(3), pages 273-282, June.
- Sabuncuoglu, Ihsan & Erel, Erdal & Alp, Arda, 2009. "Ant colony optimization for the single model U-type assembly line balancing problem," International Journal of Production Economics, Elsevier, vol. 120(2), pages 287-300, August.
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:40:y:2012:i:1:p:31-41. 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.