Scheduling stochastic two-machine flow shop problems to minimize expected makespan

During the past few years, despite tremendous contribution on deterministic flow shop problem, there are only limited number of works dedicated on stochastic cases. This paper examines stochastic scheduling problems in two-machine flow shop environment for expected makespan minimization where proces...

Full description

Bibliographic Details
Main Authors: Mehdi Heydari, Mohammad Mahdavi Mazdeh, Mohammad Bayat
Format: Article
Language:English
Published: Growing Science 2013-07-01
Series:Decision Science Letters
Subjects:
Online Access:http://www.growingscience.com/dsl/Vol2/dsl_2013_21.pdf
_version_ 1819013021797711872
author Mehdi Heydari
Mohammad Mahdavi Mazdeh
Mohammad Bayat
author_facet Mehdi Heydari
Mohammad Mahdavi Mazdeh
Mohammad Bayat
author_sort Mehdi Heydari
collection DOAJ
description During the past few years, despite tremendous contribution on deterministic flow shop problem, there are only limited number of works dedicated on stochastic cases. This paper examines stochastic scheduling problems in two-machine flow shop environment for expected makespan minimization where processing times of jobs are normally distributed. Since jobs have stochastic processing times, to minimize the expected makespan, the expected sum of the second machine’s free times is minimized. In other words, by minimization waiting times for the second machine, it is possible to reach the minimum of the objective function. A mathematical method is proposed which utilizes the properties of the normal distributions. Furthermore, this method can be used as a heuristic method for other distributions, as long as the means and variances are available. The performance of the proposed method is explored using some numerical examples.
first_indexed 2024-12-21T01:53:20Z
format Article
id doaj.art-7ed0eece58464b44943ea107129b62a2
institution Directory Open Access Journal
issn 1929-5804
1929-5812
language English
last_indexed 2024-12-21T01:53:20Z
publishDate 2013-07-01
publisher Growing Science
record_format Article
series Decision Science Letters
spelling doaj.art-7ed0eece58464b44943ea107129b62a22022-12-21T19:19:50ZengGrowing ScienceDecision Science Letters1929-58041929-58122013-07-012316317410.5267/j.dsl.2013.04.005Scheduling stochastic two-machine flow shop problems to minimize expected makespanMehdi HeydariMohammad Mahdavi MazdehMohammad BayatDuring the past few years, despite tremendous contribution on deterministic flow shop problem, there are only limited number of works dedicated on stochastic cases. This paper examines stochastic scheduling problems in two-machine flow shop environment for expected makespan minimization where processing times of jobs are normally distributed. Since jobs have stochastic processing times, to minimize the expected makespan, the expected sum of the second machine’s free times is minimized. In other words, by minimization waiting times for the second machine, it is possible to reach the minimum of the objective function. A mathematical method is proposed which utilizes the properties of the normal distributions. Furthermore, this method can be used as a heuristic method for other distributions, as long as the means and variances are available. The performance of the proposed method is explored using some numerical examples.http://www.growingscience.com/dsl/Vol2/dsl_2013_21.pdfStochastic schedulingStochastic flow shopFlow shop schedulingExpected makespan minimization
spellingShingle Mehdi Heydari
Mohammad Mahdavi Mazdeh
Mohammad Bayat
Scheduling stochastic two-machine flow shop problems to minimize expected makespan
Decision Science Letters
Stochastic scheduling
Stochastic flow shop
Flow shop scheduling
Expected makespan minimization
title Scheduling stochastic two-machine flow shop problems to minimize expected makespan
title_full Scheduling stochastic two-machine flow shop problems to minimize expected makespan
title_fullStr Scheduling stochastic two-machine flow shop problems to minimize expected makespan
title_full_unstemmed Scheduling stochastic two-machine flow shop problems to minimize expected makespan
title_short Scheduling stochastic two-machine flow shop problems to minimize expected makespan
title_sort scheduling stochastic two machine flow shop problems to minimize expected makespan
topic Stochastic scheduling
Stochastic flow shop
Flow shop scheduling
Expected makespan minimization
url http://www.growingscience.com/dsl/Vol2/dsl_2013_21.pdf
work_keys_str_mv AT mehdiheydari schedulingstochastictwomachineflowshopproblemstominimizeexpectedmakespan
AT mohammadmahdavimazdeh schedulingstochastictwomachineflowshopproblemstominimizeexpectedmakespan
AT mohammadbayat schedulingstochastictwomachineflowshopproblemstominimizeexpectedmakespan