Scheduling
Bahareh Vaisi; Hiwa Farughi; Sadigh Raissi; Heibatolah Sadeghi
Abstract
In this study, we model a stochastic scheduling problem for a robotic cell with two unreliable machines susceptible to breakdowns and subject to the probability of machine failure and machine repair. A single gripper robot facilitates the loading/unloading of parts and cell-internal movement. Since it ...
Read More
In this study, we model a stochastic scheduling problem for a robotic cell with two unreliable machines susceptible to breakdowns and subject to the probability of machine failure and machine repair. A single gripper robot facilitates the loading/unloading of parts and cell-internal movement. Since it is more complicated than the other cycles, the focus has been on the S_2 cycle as the most frequently employed robot movement cycle. Therefore, a multi-objective mathematical formulation is proposed to minimize cycle time and operational costs. The -constraint method is used to solve small-sized problems. Non-dominated sorting genetic algorithm II (NSGA-II), is used to solve large-sized instances based on a set of randomly generated test problems. The results of several Test problems were compared with those of the GAMS software to evaluate the algorithm's performance. The computational results indicate that the proposed algorithm performs well. Compared to GAMS software, the average results for maximum spread (D) and non-dominated solutions (NDS) are 0.02 and 0.04, respectively.
Operations Research
Vahid Razmjooei; Iraj Mahdavi; Selma Gutmen
Abstract
A Cellular Manufacturing System (CMS) is a suitable system for the economic manufacture of part families. Scheduling the manufacturing cells plays an effective role in successful implementation of the manufacturing system. Due to the fact that in the CMS, bottleneck machine and human resources are two ...
Read More
A Cellular Manufacturing System (CMS) is a suitable system for the economic manufacture of part families. Scheduling the manufacturing cells plays an effective role in successful implementation of the manufacturing system. Due to the fact that in the CMS, bottleneck machine and human resources are two important factors, which so far have not been studied simultaneously in a mathematical model, there should be a model to consider them. Therefore, this research develops a bi-objective model for CMS in a three-dimensional space of machine-part and human resources. The main objective is to minimize the maximum completion time of all tasks in the system and reduce the number of intercellular translocation based on bottleneck machines’ motion and human resources. Due to the NP-hardness of the studied problem, applying the conventional solution methods is very time-consuming, and is impossible in large dimensions. Therefore, the use of metaheuristic methods will be useful. The accuracy of the proposed model is investigated using LINGO by solving a small example. Then, to solve the problem in larger dimensions, a hybrid Multi-Objective Tabu Search-Genetic Algorithm (MO-TS-GA) is designed and numerical results are reported for several examples.
Scheduling
Behnaz Zanjani; Maghsoud Amiri; Payam Hanafizadeh; Maziar Salahi
Abstract
Scheduling is an important decision-making process that aims to allocate limited resources to the jobs in a production process. Among scheduling problems, Hybrid Flow Shop (HFS) scheduling has good adaptability with most real world applications including innumerable cases of uncertainty of parameters ...
Read More
Scheduling is an important decision-making process that aims to allocate limited resources to the jobs in a production process. Among scheduling problems, Hybrid Flow Shop (HFS) scheduling has good adaptability with most real world applications including innumerable cases of uncertainty of parameters that would influence jobs processing when the schedule is executed. Thus a suitable scheduling model should take parameters uncertainty into account. The present study develops a multi-objective Robust Mixed-Integer Linear Programming (RMILP) model to accommodate the problem with the real-world conditions in which due date and processing time are assumed uncertain. The developed model is able to assign a set of jobs to available machines in order to obtain the best trade-off between two objectives including total tardiness and makespan under uncertain parameters. Fuzzy Goal Programming (FGP) is applied to solve this multi objective problem. Finally, to study and validate the efficiency of the developed RMILP model, some instances of different size are generated and solved using CPLEX solver of GAMS software under different uncertainty levels. Experimental results show that the developed model can find a solution to show the least modifications against uncertainty in processing time and due date in an HFS problem.
Fuzzy optimization
Seyedeh Maedeh Mirmohseni; Seyed Hadi Nasseri; Mohammad Hossein Khaviari
Abstract
In this paper, dynamic programming for sequencing weighted jobs on a single machine to minimizing total tardiness is focused, to significance of fuzzy numbers field, and importance of that for decision makers who are facing on uncertain data, combination of dynamic programming and fuzzy numbers is applied. ...
Read More
In this paper, dynamic programming for sequencing weighted jobs on a single machine to minimizing total tardiness is focused, to significance of fuzzy numbers field, and importance of that for decision makers who are facing on uncertain data, combination of dynamic programming and fuzzy numbers is applied. A random scheduling problem with fuzzy processing times is given and solved. In addition, algorithm consuming time during solving same category problem and different sizes are analyzed that for large problem CPU time usage is extremely unaffordable. Therefore demonstration of near-exact heuristic method such as Genetic Algorithm (GA) appears. In this paper sufficient discussion around solving this kind of problems and their algorithms analysis and a combination between Dynamic Programming (DP) and genetic algorithm as a newly born method is proposed that stand on DP performance and genetic algorithm search power, and finally comparison on the recent developed method has been held. Then this method can deal with real-world problem easily. Thus, decision makers actually can use this modification of dynamic programming for coping with un-crisp problem.