Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Extending the shifting bottleneck procedure to real-life applications

Article Abstract:

The shifting bottleneck procedure (SBP) was altered so that problem characteristics such as setup times, overlapping, initial work in process, assembly and split structures, internal transportation delays and parallel machining were considered. The SBP was changed by adapting the head and tails calculations and by replacing the one-machine sub-problems by an algorithm to compute the parallel machine problem. Findings showed that the modified SBP is a very useful in solving real-life general job shop scheduling problems.

Author: Ivens, Philip, Lambrecht, Marc
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Heuristic programming

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Two branch and bound algorithms for the permutation flow shop problem

Article Abstract:

Two exact processes for the permutation flow shop problem are shown. The first methodology is based on immediate selections and optimal adjustments of heads and tails. The second approach entails recursively enumerating jobs potentially processed first and jobs which would be processed last on machines. Findings reveal that the second methodology yields better results but the first approach becomes more efficient when initial heads and tails are added.

Author: Carlier, Jacques, Rebai, Ismail
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Branch and bound algorithms

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Global lower bounds for flow shops with multiple processors

Article Abstract:

The problem of determining a method for measuring global makespan lower bounds for flow shop with multiple processors (FSMP) scheduling systems is analyzed. The development of a strong lower bound is considered as a tool to estimate maximum makespan and sub-optimal heuristic quality. It is shown that such lower bounds are effectively within 8% of optimal solutions to the FSMP problem.

Author: Santos, D.L., Hunsucker, J.L., Deal, D.E.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Models, Usage, Scheduling (Management)
Similar abstracts:
  • Abstracts: Designing channel incentives to overcome reseller rejection
  • Abstracts: A bound for the Symmetric Travelling Salesman problem through matroid formulation. Semidefinite descriptions of cones defining spectral mask constraints
  • Abstracts: Pulling the strings of China's Internet. Japan emerges from its trade shell. Towards financial efficiency
  • Abstracts: Riding the Tiger: the retaking of Jaffna. Rough edges. Truce with the tigers: a step to solve the ethnic Tamil problem
  • Abstracts: Crying all the way from the bank. Helping start-ups to take root. Business questions investment vehicle: new funding scheme makes a slow start
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.