نتایج جستجو برای: assembly flowshop

تعداد نتایج: 127701  

Journal: :international journal of advanced biological and biomedical research 2013
hamid reza guodarzi mohammad agha mohammadi mohsen mousavi1

amyloid-β (aβ) self-assembly into cross-β amyloidfibrils is implicated in a causative role in alzheimer’s disease pathology.uncertainties persist regarding the mechanisms of amyloid self assembly and the role of metastable prefibrillar aggregates. aβ fibrilsfeature a sheet-turn-sheet motif in the constituent β-strands; as such, turn nucleation has been proposed as a rate-limiting step in the se...

Journal: :Transactions of the Institute of Systems, Control and Information Engineers 1997

Journal: :Annals of Operations Research 2005

Journal: :Nigerian Journal of Technology 2015

2006
Gerrit Färber Anna M. Coves Moreno

This paper presents an extended classification for non-permutation flowshops. The versatile options which occur with the possibility of resequencing jobs within the line are considered. The literature review shows that no classification exists which considers extensively this type of flowshop.

Journal: :Electronic Notes in Discrete Mathematics 2010
Anis Gharbi Talel Ladhari Mohamed Kais Msakni Mehdi Serairi

In this paper, we address the problem of two-machine flowshop scheduling problem with sequence independent setup times to minimize the total completion time. We propose five new polynomial lower bounds. Computational results based on randomly generated data show that our proposed lower bounds consistently outperform those of the literature.

D. Gupta, S. Sharma,

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

Journal: :Yugoslav Journal of Operations Research 2022

This paper deals with the permutation flowshop scheduling problem time lags constraints to minimize total weighted tardiness criterion by using Branch and Bound algorithm. A new lower bound was developed for problem. The computational experiments indicate that proposed algorithm provides good solution in terms of quality requirements.

Journal: :Journal of the Operations Research Society of Japan 1986

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید