Resource Allocation, Batching and Dispatching in a Stochastic Flexible Job Shop

2011 ◽  
Vol 264-265 ◽  
pp. 1758-1763 ◽  
Author(s):  
Umar M. Al-Turki ◽  
Shaikh Arifusalam ◽  
Mohammed El-Seliaman ◽  
Mehmood Khan

The problem of resource allocation and scheduling is considered for a flexible job shop composed of several work centers with multiple identical machines. Each machine has its own setup time that depends on the current and the arriving batch types. The optimal number of machines at each center and the optimal batch size for each job type is to be determined for several dispatching rule. The objective of the study is to assist the scheduler in selecting the best dispatching rule with respect to a desired performance measure along with its corresponding batch size and optimum number of machines in each center. Several measures are considered including the average flow time, sum of earliness and tardiness, and the number of tardy jobs. The simulation package ProModel is used to build the model and its optimization tool called SimRunner is used for optimization.

2021 ◽  
Author(s):  
Erika Valery Lopez Roa

Cellular manufacturing has tested positive in significantly reducing material handling and setup time as compared to a job shop, but it falls behind job shop in terms of flexibility. In this thesis a new system is proposed that takes advantage of the flexibility of a job shop while it keeps the setup time at a reduced level. This new system is referred to as hybrid system. In this thesis the performance of the proposed hybrid system is compared to the conventional cellular manufacturing system. Both systems are evaluated within a cellular layout and utilize group sheduling rules DDSI (due date truncated shortest processing time) and MSSPT (minimum setup shortest processing time). A simulation model, with random due dates and quantities is developed and tested. Performance measures are mean flowtime, tardiness and earliness. Overall results indicate that, in terms of mean flowtime and tardiness, the hybrid system outperforms the cellular system when the MSSPT rule was applied, while the cellular system outperforms the hybrid system when the DDSI rule is implemented. With regard to the earliness performance measure, the cellular system shows in most cases better performance than the hybrid system, regardless of the scheduling rule used. Finally, the results indicate that the hybrid system performs better than the cellular system with respect to the number of parts produced.


2021 ◽  
Author(s):  
Erika Valery Lopez Roa

Cellular manufacturing has tested positive in significantly reducing material handling and setup time as compared to a job shop, but it falls behind job shop in terms of flexibility. In this thesis a new system is proposed that takes advantage of the flexibility of a job shop while it keeps the setup time at a reduced level. This new system is referred to as hybrid system. In this thesis the performance of the proposed hybrid system is compared to the conventional cellular manufacturing system. Both systems are evaluated within a cellular layout and utilize group sheduling rules DDSI (due date truncated shortest processing time) and MSSPT (minimum setup shortest processing time). A simulation model, with random due dates and quantities is developed and tested. Performance measures are mean flowtime, tardiness and earliness. Overall results indicate that, in terms of mean flowtime and tardiness, the hybrid system outperforms the cellular system when the MSSPT rule was applied, while the cellular system outperforms the hybrid system when the DDSI rule is implemented. With regard to the earliness performance measure, the cellular system shows in most cases better performance than the hybrid system, regardless of the scheduling rule used. Finally, the results indicate that the hybrid system performs better than the cellular system with respect to the number of parts produced.


2005 ◽  
Vol 1 (2) ◽  
pp. 24-30
Author(s):  
P.D.D. Dominic

Job shop scheduling (JSS) problems consist of a set of machines and a collection of jobs to be scheduled. Each job consists of several operations with specified processing order. In this paper, Job Shop Model problem is scheduled by using Genetic Algorithm (GA), Simulated Annealing (SA) and Hybrid Simulated Annealing (HSA). Those three are considered as different treatments of each problem and are compared with the objective measure of number of tardy jobs in a job shop environment. The conclusion is that the performance measure Number of tardy jobs is minimum in the most of the cases under Genetic Algorithm when compared with other two algorithms.


Sign in / Sign up

Export Citation Format

Share Document