Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
Article Abstract:
Three improved branch-and-bound algorithms based on CA and other existing techniques are presented. A new lower bound and a problem size reduction technique is also proposed.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
Algorithms, Algorithm
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
Stability analysis of an optimal balance for an assembly line with fixed cycle time
Article Abstract:
The simple assembly line balancing problem is discussed. The stability of an assembly line with fixed cycle time is analyzed.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
Subjects list: Analysis, Europe, Assembly-line balancing
Similar abstracts:
- Abstracts: A branch-and-bound algorithm for the mini-max spanning forest problem. An improved algorithm to determine lower bounds for fixed spectrum frequency assignment problem
- Abstracts: Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem. Sequential selection procedures: using sample means to improve efficiency
- Abstracts: An linear programming based lower bound for the simple assembly line balancing problem. Cost-oriented assembly line balancing: Model formulations, solution difficulty, upper and lower bounds
- Abstracts: A special case of transfer lines balancing by graph approach . Controlling mixed-model assembly lines in real-time by using distributed systems
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.