Publication:
Scheduling in stochastic flowshops with independent setup, processing and removal times

Simple item page
dc.contributor.authorsAllahverdi A.
dc.date.accessioned2022-03-15T01:53:24Z
dc.date.accessioned2026-01-11T07:58:50Z
dc.date.available2022-03-15T01:53:24Z
dc.date.issued1997
dc.description.abstractThe two-machine flowshop problem, where setup and removal times are independent from processing times and machines suffer stochastic breakdowns, is considered with respect to makespan performance measure. After the problem is formulated, an objective function for the makespan is developed. Under certain conditions on the breakdown processes, it is shown that Sule and Huang's [5] algorithm for the deterministic problem stochastically minimizes makespan for the stochastic counterpart problem. © 1997 Elsevier Science Ltd.
dc.identifier.doi10.1016/S0305-0548(97)00006-3
dc.identifier.issn3050548
dc.identifier.urihttps://hdl.handle.net/11424/246323
dc.language.isoeng
dc.publisherElsevier Ltd
dc.relation.ispartofComputers and Operations Research
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.titleScheduling in stochastic flowshops with independent setup, processing and removal times
dc.typearticle
dspace.entity.typePublication
oaire.citation.endPage960
oaire.citation.issue10
oaire.citation.startPage955
oaire.citation.titleComputers and Operations Research
oaire.citation.volume24

Files

Collections

Araştırma Çıktıları