Scheduling of production in Flexible Manufacturing Systems (FMSs) has been extensively investigated over the past years and it continues to attract the interest of both academic researchers and practitioners. The generation of new and modified production schedules is becoming a necessity in today’s complex manufacturing environment. Genetic algorithms are used in this paper to obtain an initial...

Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...

In this paper, the problem of short-term production planning in flexible flow lines is considered. A MIP model formulation of the proportional lot sizing problem for multilevel production processes with alternatively usable machines is presented. This model is very general in terms of material routing through the system and allocation of items and machines to production stages. By definition of...

A simulation-based real-time scheduling mechanism for dynamic discrete manufacturing is presented in this paper. Modified mean flow time performance for different scheduling approaches is compared through off-line simulation experiments, under dynamic manufacturing environments that are subjects to disturbances such as machine breakdowns. These experimental results are used as reference indices...

It is vital for manufacturing companies not only to cope with frequent product changes and fluctuating demands, but also to reduce the impact of disturbances on the overall manufacturing performance. In this paper a real-time scheduling mechanism for dynamic discrete manufacturing is presented. Modified mean flow time performance for different scheduling approaches is compared through off-line ...

We are interested here in new sub cases for which permutation flow shop schedules are dominant while considering the classical flow shop scheduling problem and the makespan criterion. To obtain these sub cases, we introduce conditions on the lower and upper bounds of the processing times. These conditions can be quite realistic when the corresponding line is balanced.