New Heuristic Algorithm for Flow Shop Scheduling with 3 Machines and 2 Robots Considering the Breakdown Interval of Machines and Robots Simultaneously

Document Type: Original Manuscript


1 MSc Student, Department of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran

2 Department of Industrial Engineering, Iran University of Science and Technology, Narmak, Tehran, Iran

3 Islamic Azad University, Qazvin Branch, Department of Industrial and Mechanical Engineering, Qazvin, Iran


Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. The concept of transportation time is very important in scheduling. Transportation can be done by robots. In situations that robots are used to transport materials (material handler), breakdown of the machines and robots have a significant role in the production concern. This paper deals with minimization of the total elapsed time for flow shop scheduling problem (number of machine=3) in which the effect of machine and robots breakdown interval are considered simultaneously. Furthermore, by providing an example, the proposed algorithm is described. A summary and future works conclude the paper


  • This paper deals with a new heuristic algorithm for n-jobs, 3 machines, and 2 robots flow.
  • Studding shop scheduling problem considering the breakdown interval of machines and robots simultaneously.
  • Using a heuristic algorithm to minimize total elapsed time, whenever mean weighted production flow time is taken into consideration.
  • Giving a numerical illustration to clarify the algorithm.