| Article ID: | iaor201525482 |
| Volume: | 18 |
| Issue: | 2 |
| Start Page Number: | 159 |
| End Page Number: | 169 |
| Publication Date: | Jun 2014 |
| Journal: | International Journal of Logistics Systems and Management |
| Authors: | Azadeh Ali, Nazari Tayebeh, Rahbar Seyed Ehsan |
| Keywords: | combinatorial optimization, stochastic processes, queues: applications, programming: linear |
In this paper, we study an open shop scheduling (OSS) problem subject to uncertain release dates and processing times. Open shop scheduling problems are one of shop problems in sequence and scheduling problems. The objective is to find the sequence of jobs and machines which minimises total completion times of jobs. We first formulate the problem as a stochastic programming model, and then we employ deterministic mixed binary integer linear programming to solve the linear programming solver. In this paper, we assumed the processing times and release times of jobs to be uncertain, but follow a specific probability function. It is clear that random variables are independent. We use GAMS software to solve it. The superiority and advantages of this study over previous studies are discussed.