Group shops scheduling with makespan criterion subject to random release dates and processing times |
| |
Authors: | Fardin Ahmadizar Mehdi Ghazanfari Seyyed Mohammad Taghi Fatemi Ghomi |
| |
Affiliation: | aDepartment of Industrial Engineering, University of Kurdistan, Pasdaran Boulvard, Sanandaj, Iran;bDepartment of Industrial Engineering, Iran University of Science and Technology, Narmak, Tehran 16846 13114, Iran;cDepartment of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran |
| |
Abstract: | This paper deals with a stochastic group shop scheduling problem. The group shop scheduling problem is a general formulation that includes the other shop scheduling problems such as the flow shop, the job shop and the open shop scheduling problems. Both the release date of each job and the processing time of each job on each machine are random variables with known distributions. The objective is to find a job schedule which minimizes the expected makespan. First, the problem is formulated in a form of stochastic programming and then a lower bound on the expected makespan is proposed which may be used as a measure for evaluating the performance of a solution without simulating. To solve the stochastic problem efficiently, a simulation optimization approach is developed that is a hybrid of an ant colony optimization algorithm and a heuristic algorithm to generate good solutions and a discrete event simulation model to evaluate the expected makespan. The proposed approach is tested on instances where the random variables are normally, exponentially or uniformly distributed and gives promising results. |
| |
Keywords: | Group shop scheduling problem Random release dates Random processing times Makespan Ant colony algorithm Simulation |
本文献已被 ScienceDirect 等数据库收录! |
|