tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. hence, integration has been proposed to decide about these problems concurrently. main problem in integration is how we can relate pro...

A fast branch & bound method for the open-shop problem based on a disjunctive graph formulation of the problem is developed. Computational results show that the method yields excellent results. Some benchmark problems from the literature were solved to optimality for the first time.

Bio-Inspired computing is the subset of Nature-Inspired computing. Job Shop Scheduling Problem is categorized under popular scheduling problems. In this research work, Bacterial Foraging Optimization was hybridized with Ant Colony Optimization and a new technique Hybrid Bacterial Foraging Optimization for solving Job Shop Scheduling Problem was proposed. The optimal solutions obtained by propos...

A scheduling system is proposed and developed for a special type of flow shop. In this flow shop there is one machine at each stage. A job may require multiple operations at each stage. The first operation of a job on stage j cannot start until the last operation of the job on stage j-1 has finished. Preemption of the operations of a job is not allowed. The flow shop that we consider has anothe...

Considering the standard particle swarm optimization (PSO) has the shortcomings of low convergence precision in job shop scheduling problems, the job shop scheduling solution is presented based on improved particle swarm optimization (A-PSO). In this paper, the basic theory of A-PSO is described. Also, the coding and the selection of parameters as well as the decoding of A-PSO are studied. It u...

A fast branch and bound algorithm for the job-shop scheduling problem has been developed. Among other hard problems it solves the 10 x 10 benchmark problem which has been open for more than 20 years. We will give a complete description of this algorithm and will present computational results.

The flexible job shop scheduling problem (FJSP) is one of the most difficult NP-hard combinatorial optimization problems. It is extremely difficult to solve the FJSP with the disturbances of manufacturing environment, which is always regarded as the flexible job shop online scheduling problem. This paper proposes a new method based on Process-Tree to solve this type of scheduling problem. Proce...

In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

In most real production environment, schedules are usually inevitable with the presence of a variety of unexpected disruptions. Thus it is necessary to develop predictive/reactive schedules which can absorb disruptions while maintaining high shop performance. In this paper, a robust predictive/reactive scheduling method is developed for solving job shop scheduling in dynamic environment. It con...