Bi criteria flexible assembly line design problem with equipment decisions.
Saved in:
| Title: | Bi criteria flexible assembly line design problem with equipment decisions. |
|---|---|
| Authors: | Pekin, N.1 (AUTHOR), Azizoglu, M.2 (AUTHOR) meral@ie.metu.edu.tr |
| Source: | International Journal of Production Research. Nov2008, Vol. 46 Issue 22, p6323-6343. 21p. 5 Diagrams, 7 Charts. |
| Subjects: | Microcomputer workstations (Computers), Branch & bound algorithms, Assembly line balancing, Production engineering, Computers in production engineering, Computer manufacturing |
| Abstract: | In this paper, we address the assembly line balancing and design problem of assigning tasks and equipment to work stations where there are several equipment alternatives for each task. We consider minimizing the total equipment cost and the number of work stations criteria. We aim to generate efficient solutions with respect to these criteria and propose a branch and bound algorithm whose efficiency is enhanced with powerful reduction and bounding mechanisms. We find that our algorithm is capable of solving problem instances with up to 25 tasks and five pieces of equipment. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 34576596 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Bi criteria flexible assembly line design problem with equipment decisions. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Pekin%2C+N%2E%22">Pekin, N.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Azizoglu%2C+M%2E%22">Azizoglu, M.</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> meral@ie.metu.edu.tr</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Production+Research%22">International Journal of Production Research</searchLink>. Nov2008, Vol. 46 Issue 22, p6323-6343. 21p. 5 Diagrams, 7 Charts. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Microcomputer+workstations+%28Computers%29%22">Microcomputer workstations (Computers)</searchLink><br /><searchLink fieldCode="DE" term="%22Branch+%26+bound+algorithms%22">Branch & bound algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Assembly+line+balancing%22">Assembly line balancing</searchLink><br /><searchLink fieldCode="DE" term="%22Production+engineering%22">Production engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Computers+in+production+engineering%22">Computers in production engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+manufacturing%22">Computer manufacturing</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: In this paper, we address the assembly line balancing and design problem of assigning tasks and equipment to work stations where there are several equipment alternatives for each task. We consider minimizing the total equipment cost and the number of work stations criteria. We aim to generate efficient solutions with respect to these criteria and propose a branch and bound algorithm whose efficiency is enhanced with powerful reduction and bounding mechanisms. We find that our algorithm is capable of solving problem instances with up to 25 tasks and five pieces of equipment. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=34576596 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1080/00207540701441988 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 21 StartPage: 6323 Subjects: – SubjectFull: Microcomputer workstations (Computers) Type: general – SubjectFull: Branch & bound algorithms Type: general – SubjectFull: Assembly line balancing Type: general – SubjectFull: Production engineering Type: general – SubjectFull: Computers in production engineering Type: general – SubjectFull: Computer manufacturing Type: general Titles: – TitleFull: Bi criteria flexible assembly line design problem with equipment decisions. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Pekin, N. – PersonEntity: Name: NameFull: Azizoglu, M. IsPartOfRelationships: – BibEntity: Dates: – D: 15 M: 11 Text: Nov2008 Type: published Y: 2008 Identifiers: – Type: issn-print Value: 00207543 Numbering: – Type: volume Value: 46 – Type: issue Value: 22 Titles: – TitleFull: International Journal of Production Research Type: main |
| ResultId | 1 |
