Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A branch-and-branch algorithm for solving the group technology problem

From MaRDI portal
Publication:922271
Jump to:navigation, search

zbMath0709.90056MaRDI QIDQ922271

Chun Hung Cheng, Andrew Kusiak

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)


zbMATH Keywords

branch-and-bound algorithmcomputational resultsbottleneck machinesgroup technology problem


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)


Related Items (3)

Dynamic cellular manufacturing system design considering alternative routing and part operation tradeoff using simulated annealing based genetic algorithm ⋮ Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing ⋮ Seriation and matrix reordering methods: An historical overview







This page was built for publication: A branch-and-branch algorithm for solving the group technology problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:922271&oldid=12886520"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 17:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki