Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function

Article Abstract:

A study was conducted on the use of a makespan criterion for scheduling a two-machine flowshop prone to random breakdowns. It was proven that it suffices to consider the same job sequences on each machine. Johnson's algorithm was found to be capable of stochastically minimize makespan under particular conditions after an elimination criterion for minimizing makespan was obtained.

Research, Stochastic processes

---

No-wait flowshops with bicriteria of makespan and maximum lateness

Article Abstract:

The m-machine no-wait flowshop scheduling problem with a weighted sum of makespan and maximum lateness criteria, known as bicriteria is described. The problem reduces to the single criterion of makespan or maximum lateness when a weight of zero is assigned to makespan or maximum lateness.

Heuristic, Maxima and minima, Maxima and minima (Mathematics), Heuristics (Psychology)

---

The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime

Article Abstract:

Application of heuristics to develop dominance relations for solution of scheduling problems in manufacturing facilities, based on mean flowtime and makespan, is described.

Kuwait, Mathematical models, Heuristic programming

Similar abstracts:

• Abstracts: Timing of entry and the foreign subsidiary performance of Japanese firms. A resource-based model of market learning in the subsidiary: the capabilities of exploration and exploitation
• Abstracts: Simulation of ECB decisions and forecast of short term Euro rate with an adaptive fuzzy expert system
• Abstracts: On latest starting times and floats in activity networks with ill-known durations. On two single machine scheduling problems with fuzzy processing times and fuzzy due dates
• Abstracts: Scheduling uncertain orders in the customer-subcontractor context. A fuzzy genetic algorithm for driver scheduling
• Abstracts: Strategic route extension in transit networks. A model for the management of a tram fleet

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