the aim of this paper is to study a multi-product, multi-period production systems in a hybrid flow shop so that lot-sizing and scheduling will be detemined simultaneously. a new mixed-integer programming model is proposed to formulate the studied problem. the objective function in this investigation includes the total cost of production, inventory and external supply. in the case of not satisf...

Genetic algorithms are a very popular heuristic which have been successfully applied to many optimization problems within the last 30 years. In this chapter, we give a survey on some genetic algorithms for shop scheduling problems. In a shop scheduling problem, a set of jobs has to be processed on a set of machines such that a specific optimization criterion is satisfied. According to the restr...

This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...

The n-job, m-machine flow shop scheduling problem is one of the most general job scheduling problems. This study deals with the multi objective optimization with the criteria of makespan minimization and minimization of total weighted flow time for the flow shop scheduling problem. The n-job mmachine problem is known to be NP hard problem, several meta heuristics have been applied so far in the...

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

Permutation flow shop scheduling problem (PFSP) is a well-known NP-hard with extensive engineering relevance. Consequently, various meta-heuristics have been proposed to obtain near optimum solutions. However, most of them involve tuning algorithm-specific parameters, which leads excessive computational complexities. A recently developed meta-heuristic named Jaya algorithm simple yet efficient ...

This research combines between two different manufacturing concepts. On the one hand, flow shop scheduling is a well-known problem in production systems. The problem appears when a group of jobs shares the same processing sequence on two or more machines sequentially. Flow shop scheduling tries to find the appropriate solution to optimize the sequence order of this group of jobs over the existi...