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...
Saved in:
Main Authors: | Mohammad Bayat, Mehdi Heydari, Mohammad Mahdavi Mazdeh |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2013/916978 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Racial Authoritarian Preemption and the Politics of Tennessee
by: Sekou Franklin
Published: (2024-12-01) -
A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems
by: Le Zhang, et al.
Published: (2014-01-01) -
Hybrid Particle Swarm Optimization for Hybrid Flowshop Scheduling Problem with Maintenance Activities
by: Jun-qing Li, et al.
Published: (2014-01-01) -
A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems
by: Chia-Shin Chung, et al.
Published: (2012-01-01) -
Two-machine flowshop scheduling problem to minimize makespan or
total completion time with random and bounded setup times
by: Ali Allahverdi, et al.
Published: (2003-01-01)