In this paper, we address the problem of finding a permutation schedule of n jobs in an m machine flow-shop environment that minimizes the maximum completion time Cmax (Makespan) of all jobs. The jobs are available at time zero and have sequence-dependent setup times on each machine. All parameters, such as processing and setup times, are assumed to be known with certainty. This problem is clas...

Job shop scheduling problems occurs in automobile industry, aerospace industry, printing industry, and chemical industry. Job shop scheduling problems are real world and complex. The present work assesses the effect of change in setup times levels on make span, maximum flow time and maximum tardiness measures. The model of the job shop is developed in PROMODEL simulation software. Three levels ...

In this paper the flow shop scheduling problem with minimizing two criteria simultaneously is consider. Selected criteria are: makespan and the sum of tardiness of jobs. For each separate criteria the problem is strongly NP-hard, which makes it NP-hard as well. There is a number of heuristic algorithms to solve the flow shop problem with various single objectives, but heuristics for multi-crite...

job shop scheduling problem has significant importance in many researchingfields such as production management and programming and also combinedoptimizing. job shop scheduling problem includes two sub-problems: machineassignment and sequence operation performing. in this paper combination ofparticle swarm optimization algorithm (pso) and gravitational search algorithm(gsa) have been presented f...

Production processes in Cellular Manufacturing Systems (CMS) often involve groups of parts sharing the same technological requirements in terms of tooling and setup. The issue of scheduling such parts through a flow-shop production layout is known as the Flow-Shop Group Scheduling (FSGS) problem or, whether setup times are sequence-dependent, the Flow-Shop Sequence-Dependent Group Scheduling (F...

different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. conventional productionmethods are constantly subs...

this study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. the problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. the time interval between consecutive maintenance activities as well as the...

this paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. first, the problem is formulated as a mixed integer linear programming model. then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. two experiments are carried out to evaluate th...

This paper deals with performance evaluation and scheduling problems in m machine stochastic flow shop with unlimited buffers. The processing time of each job on each machine is a random variable exponentially distributed with a known rate. We consider permutation flow shop. The objective is to find a job schedule which minimizes the expected makespan. A classification of works about stochastic...