Multiprocessor task scheduling is a generalized form of classical machine scheduling where a task is processed by more than one processor. It is a challenging problem encountered in wide range of applications and it is vastly studied in the scheduling literature (see for instance (Chan & Lee, 1999 and Drozdowski, 1996) for a comprehensive introduction on this topic). However, Drozdowski (1996) ...

The job shop scheduling problem is a combinatorial optimization problem and one of the most complex problems among various production scheduling problems. The present work assesses the effect of change in setup time’s levels on mean flow time and means tardiness measures. The simulation model of the job shop is developed for investigation purpose. Three levels of setup times i.e. SUL_1, SUL_2 a...

In a proportionate flow shop problem several jobs have to be processed through a fixed sequence of machines and the processing time of each job is equal on all machines. By identifying jobs with agents whose costs linearly depend on the completion time of their jobs and assuming an initial processing order on the jobs, we face two problems: the first is how to obtain an optimal order that minim...

in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...

This paper presents the salient aspects of a simulation-based experimental study of scheduling rules for scheduling a dynamic job shop in which the setup times are sequence dependent. A discrete event simulation model of the job shop system is developed for the purpose of experimentation. Seven scheduling rules from the literature are incorporated in the simulation model. Five new setup-oriente...

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

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 pros and cons, each of which is suitable to a specific kind of factory. ...

A discrete event simulation model was developed to study the flow of material and product in a shop floor. It uses real time data available from a job shop sole dedicated to noncommercial contracts and as such deals with very seasonal demand. The objective of this model is to provide the shop with a decision support tool that will assist in evaluating the movement of products throughout the sho...

This paper deals with the problem of optimization of job sequence in a two-machine flow shop problem in the presence of uncertainty. It is assumed that the processing times of jobs on the machines are described by triangular fuzzy sets. A new optimization algorithm based on Johnson’s algorithm for deterministic processing times and on an improvement of McCahon & Lee’s algorithm is developed and...

All rights reserved by www.ijsrd.com 607 A Genetic Algorithm Approach for Minimization of Mean Flow Time in Job Shop Scheduling Sunil Singh Narendra Jaiswal Department of Mechanical Engineering Vindhya Institute of Technology and Science, Satna 485001, Madhya Pradesh, India Abstract— This dissertation is motivated by a scheduling problem that is commonly observed in today’s manufacturing world....