Heuristic for stochastic online flowshop problem with preemption penalties
From MaRDI portal
Publication:2312307
DOI10.1155/2013/916978zbMath1417.90074OpenAlexW2145509545WikidataQ58921924 ScholiaQ58921924MaRDI QIDQ2312307
Mehdi Heydari, Mohammad Mahdavi Mazdeh, Mohammad Reza Bayat
Publication date: 5 July 2019
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/916978
Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36)
Cites Work
- A comprehensive review and evaluation of permutation flowshop heuristics
- A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
- Johnson's problem with stochastic processing times and optimal service level
- Optimal two- and three-stage production schedules with setup times included
- Principles of Sequencing and Scheduling
- Three-machine flowshop stochastic scheduling to minimize distribution of schedule length
- On Johnson's Two-Machine Flow Shop with Random Processing Times
- The Complexity of Flowshop and Jobshop Scheduling
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
This page was built for publication: Heuristic for stochastic online flowshop problem with preemption penalties
