Heuristic for Stochastic Online Flowshop Problem with Preemption Penalties
The deterministic flowshop model is one of the most widely studied problems; whereas its stochastic equivalent has remained a challenge. Furthermore, the preemptive online stochastic flowshop problem has received much less attention, and most of the previous researches have considered a nonpreemptiv...
Main Authors: | Mohammad Bayat, Mehdi Heydari, Mohammad Mahdavi Mazdeh |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2013/916978 |
Similar Items
-
A TWO-STAGE GREEDY HEURISTIC FOR A FLOWSHOP SCHEDULING PROBLEM UNDER TIME-OF-USE ELECTRICITY TARIFFS
by: Amir Ebrahimzadeh Pilerood, et al.
Published: (2018-05-01) -
Scheduling stochastic two-machine flow shop problems to minimize expected makespan
by: Mehdi Heydari, et al.
Published: (2013-07-01) -
Heuristics and metaheuristics for heavily constrained hybrid flowshop problems
by: Urlings ., Thijs
Published: (2010) -
Resource Constrained Project Scheduling Subject to Due Dates: Preemption Permitted with Penalty
by: Behrouz Afshar-Nadjafi
Published: (2014-01-01) -
Heuristics for a permutation flowshop scheduling problem with weighted squared tardiness
by: Maria Raquel de Carvalho Costa
Published: (2019)