Skip to content
Publish & Distribute
Publishing Solutions
Distribution Solutions
Library Services
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Journal Matcher
Blog
Contact
Search
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Foundations of Computing and Decision Sciences
Volume 37 (2012): Issue 2 (June 2012)
Open Access
A tabu search algorithm for the cell formation problem with part machine sequencing
G. Papaioannou
G. Papaioannou
Search for this author on
Sciendo
|
Google Scholar
Papaioannou, G.
and
J.M. Wilson
J.M. Wilson
Search for this author on
Sciendo
|
Google Scholar
Wilson, J.M.
Oct 01, 2012
Foundations of Computing and Decision Sciences
Volume 37 (2012): Issue 2 (June 2012)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Download Cover
Published Online:
Oct 01, 2012
Page range:
97 - 127
DOI:
https://doi.org/10.2478/v10209-011-0008-7
Keywords
cell formation
,
mixed integer linear programming
,
tabu search
,
part allocation
,
part machine operation sequence
This content is open access.
