Two-Level Robust Optimization for Uncertain Job Shop Scheduling Problem

2014 ◽  
Vol 1039 ◽  
pp. 514-521
Author(s):  
Bing Wang ◽  
Xiao Yan Li ◽  
He Xia Meng

This paper proposes a two-level robust optimization model in the context of job shop scheduling problem. The job shop scheduling problem optimizes the makespan under uncertain processing times, which are described by a set of scenarios. In the first-level optimization, a traditional stochastic optimization model is conducted to obtain the optimal expected performance as a standard performance, on which a concept of bad-scenario set is defined. In the second-level optimization, a robustness measure is given based on bad-scenario set. The objective function for the second robust optimization model is to combine expected performance and robustness measure. Finally, an extensive experiment was conducted to investigate the advantages of the proposed robust optimization model. The computational results show that the two-level model can achieve a better compromise between average performance and robustness than the existing robust optimization models.

2014 ◽  
Vol 607 ◽  
pp. 569-572 ◽  
Author(s):  
Qing Chi ◽  
Xiu Li Fu ◽  
Ya Nan Pan ◽  
Zeng Hui An

The job-shop scheduling problem with alternative machines is very complicated and hard to simplify during product management system for discrete manufacturing enterprise. According to the integrated constraint condition of the processing technology and equipment resources, an optimization model for the dispatch plan of processing technology for the gear shaft assembly is analyzed and established in this paper. Furthermore, the optimization results for the process sequence planning of the gear shaft assembly are obtained by iterative algorithm and improved genetic algorithms approach. The calculating program of optimization layout is developed by Matlab. The optimization results show that the production cycle time and operating cost is reduced remarkably and the efficiency is also improved. Through analysis and verification, it is optimal and feasible for discrete manufacturing enterprise in engineering applications.


SIMULATION ◽  
2020 ◽  
pp. 003754972096889
Author(s):  
Rylan H Caldeira ◽  
A Gnanavelbabu

In this work, we address the flexible job shop scheduling problem (FJSSP), which is a classification of the well-known job shop scheduling problem. This problem can be encountered in real-life applications such as automobile assembly, aeronautical, textile, and semiconductor manufacturing industries. To represent inherent uncertainties in the production process, we consider stochastic flexible job shop scheduling problem (SFJSSP) with operation processing times represented by random variables following a known probability distribution. To solve this stochastic combinatorial optimization problem we propose a simulation-optimization approach to minimize the expected makespan. Our approach employs Monte Carlo simulation integrated into a Jaya algorithm framework. Due to the unavailability of standard benchmark instances in SFJSSP, our algorithm is evaluated on an extensive set of well-known FJSSP benchmark instances that are extended to SFJSSP instances. Computational results demonstrate the performance of the algorithm at different variability levels through the use of reliability-based methods.


Sign in / Sign up

Export Citation Format

Share Document