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

Authors

  • hassan haleh Islamic Azad University, Qazvin Branch, Department of Industrial and Mechanical Engineering, Qazvin, Iran
  • mahdi eghbali MSc Student, Department of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
  • Mohammad Saidi Mehrabad Department of Industrial Engineering, Iran University of Science and Technology, Narmak, Tehran, Iran
Abstract:

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

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

new heuristic algorithm for flow shop scheduling with 3 machines and 2 robots considering the breakdown interval of machines and robots simultaneously

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 transpor...

full text

Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...

full text

Electromagnetism-like algorithm for fuzzy flow shop batch processing machines scheduling to minimize total weighted earliness and ‎tardiness‎

‎In this paper, we study a flow shop batch processing machines scheduling problem. The fuzzy due dates are considered to make the problem more close to the reality. The objective function is taken as the weighted sum of fuzzy earliness and fuzzy tardiness. In order to tackle the given problem, we propose a hybrid electromagnetism-like (EM) algorithm, in which the EM is hybridized with a diversi...

full text

bicriteria scheduling in hybrid flow shop with unrelated parallel machines

this study considers scheduling in hybrid flow shop environment with unrelated parallel machines for minimizing mean of job's tardiness and mean of job's completion times. this problem does not study in the literature, so far. flexible flow shop environment is applicable in various industries such as wire and spring manufacturing, electronic industries and production lines. after mode...

full text

Fuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm

Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...

full text

A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines

Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 10  issue 21

pages  41- 46

publication date 2016-12-25

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023