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...

INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY On Two Stage Open Shop Scheduling in Which Processing Time, Set Up Time Associated with Probabilities Including Job Block Criteria Deepak Gupta, Manjeet Kaur *1,2 Department of Mathematics, Maharishi Markandeshwar University, Mullana, Ambala, India [email protected] Abstract The present paper is an attempt through heu...

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...

In this paper, we propose 260 scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems. The types of problems that we propose are : the permutation flow shop, the job shop and the open shop scheduling problems. We restrict us to basic problems : the processing times are fixed, there are neither set-up tim...

The job shop scheduling problem (JSSP) has attracted much attention in the field of both information sciences and operations research. This paper considers the permutation Job shop scheduling problem with the objective of minimizing make span. Artificial Bee Colony algorithm (ABC) is one of the search heuristics used to solve global optimization problems in complex search spaces. It is observed...

Scheduling is a scientific domain concerning the allocation of limited tasks over time. The goal of scheduling is to maximize (or minimize) different criteria of a facility as makespan, occupation rate of a machine, total tardiness ... In this area, scientific community usually group the problem with, on one hand the system studied, defining the number of machines (one machine, parallel machine...