Stochastically minimizing the makespan in two-machine flow shops without blocking

Article Abstract:

Research was conducted to examine a two-machine stochastic flow shop with an infinite storage between the machines. A new sufficient condition that is weaker than that presented by S.-C. Niu and assoc and is not limited to the interchange of adjacent jobs. It is hypothesized that all optimal scheduling rules for reducing the makespan can be obtained from the given condition. Results provide new opportunities for deriving heuristic and optimal scheduling rules under less restrictive conditions.

Research, Stochastic processes, Permutations

---

On no-wait and no-idle flow shops with makespan criterion

Article Abstract:

A scheduling methodology to deal with NP-problems of minimizing the makespan in m-machine no-wait and no-idle permutation flow shops is presented.

Usage, Mathematical optimization, Optimization theory

---

A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation

Article Abstract:

A frame work, which supports decision making process in minimizing the expected makespan in a two-machine flow shop, is presented.

Decision-making, Decision making

Similar abstracts:

• Abstracts: Sliding GM tries to regain traction. Should GMAC go on the block? Top dealer backs GM's price cuts
• Abstracts: A new perspective on the female expatriate experience: the role of host country national organization. Career paths of global managers: towards future research
• Abstracts: On the Coleman indices of voting power. Dynamic pricing with real-time demand learning. Nodal aggregation of resource constraints in a shortest path problem
• Abstracts: A fast tabu search algorithm for the permutation flow-shop problem
• Abstracts: The value of combining forecasts in inventory management - a case study in banking. Multi-item spare parts systems with lateral transshipments and waiting time constraints

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