In this paper, mathematical models for permutation flow shop scheduling and job shop scheduling problems are proposed. The first problem is based on a mixed integer programming model. As the problem is NP-complete, this model can only be used for smaller instances where an optimal solution can be computed. For large instances, another model is proposed which is suitable for solving the problem ...

This thesis deals mainly with makespan minimization in Flow-Shop and hybrid Flow-Shop scheduling problems where mixed blocking constraints are considered. In Flow-Shop scheduling problem, a set of N jobs must be executed on a set of M machines. All jobs require the same operation order that must be executed according to the same manufacturing process. Each machine can only execute one job at an...

The IC packaging industry relies heavily on shop floor information, necessitating the development of a data model to flexibly define shop floor information in the production flow. For this purpose, this work designs a novel data model by using IDEF1x. The proposed data model consists of four modules: operation template setup, general process setup, enhanced bill of manufacture (EBOMfr) setup, a...

Stability analysis consists of identifying conditions under which the number of jobs in a system is guaranteed to remain bounded over time. To date, such longrun performance guarantees have not been available for periodic approaches to dynamic scheduling problems. However, stability has been extensively studied in queueing theory. In this paper, we introduce stability to the dynamic scheduling ...

The decision support system (DSS) presented here is dealing with the production planning and scheduling in the textile industry. The DSS aims at the efficient management of a mixed production system Gob-shop and flow-shop), such as that of the textile industry. Its main feature is the effective combination of a database and a model based management system in order to merge existing expert knowl...

In this paper we consider n-jobs, m-machines permutation flow shop scheduling problems. Flow shop scheduling is one of the most important combinational optimization problems. The permutation flow shop scheduling problems are NP-Hard (Non deterministic Polynomial time Hard). Hence many heuristics and metaheuristics were addressed in the literature to solve these problems. In this paper a hybrid ...

production planning is performed through diverse methods according to the type of the system it is structured upon. one of the most important steps before production planning is to determine which system best fits the firm, and how the facilities should be designed. both job-shop and group-technology systems have their own cons and pros, each of which is suitable to a specific kind of factory. ...