The two-machine flow shop problem with arbitrary precedence relations

Article Abstract:

A branch and bound algorithm for the solution of the n-job 2-machine flow shop problem with precedence limitations is described. The computation of bounds is performed by solving relaxed problems with series-parallel limitations. The with and without S-P bounds versions of the algorithm are tested, with the former showing applicability up to jobsets containing 50 jobs in less than 5,000 nodes. The latter, on the other hand, yields superior results for the 2-machine makespan problem with precedence constraints.

---

Flow-shops with a dominant machine

Article Abstract:

A discussion of a new subclass of flow-shop problems involves dominant machines. Two proposed algorithms for the minimization of weighted completion times and maximal lateness assume the criteria sigma alpha(i)C(i) and L(max). Results show that solutions can focus on permutation schedules with the new subclass and given a regular criterion. In addition, processing time computations are also presented in realtion to a semi-active permutation schedule.

---

Overcoming the service paradox in manufacturing companies

Article Abstract:

A study on extending service business by manufacturing companies for the purpose of reaping more financial benefits is presented. It is observed that extending serviced business leads to increased service offerings and higher costs but does not generate higher financial benefits. Based on the analysis of the study results, guidance is provided to managers under study.

Switzerland, Science & research, Financial Systems & Controls, Financial Management, Economic aspects

Similar abstracts:

• Abstracts: Against the flow. Going with the flow. Cold war against Islam
• Abstracts: The coming of the wired city: the recent development of cable in Britain. The 1991 City Challenge bids
• Abstracts: Production planning for an artists studio - a case study. Tactical planning of offshore petroleum production
• Abstracts: Vendor selection and evaluation: an activity based costing approach

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.