نتایج جستجو برای: open shop with no buffer

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

Bahman Naderi Esmaeil Najafi Mehdi Yazdani

This paper considers open-shop scheduling with no intermediate buffer to minimize total tardiness. This problem occurs in many production settings, in the plastic molding, chemical, and food processing industries. The paper mathematically formulates the problem by a mixed integer linear program. The problem can be optimally solved by the model. The paper also develops a novel metaheuristic base...

Journal: :Journal of Industrial Engineering International 2012

Journal: :journal of advances in computer research 2012
behnam barzegar homayun motameni ali khosrozadeh ghomi azadeh divsalar

proper scheduling of tasks leads to optimum using of time and resources, inorder to obtaining best result. one of the most important and complicatedscheduling problems is open shop scheduling problem. there are n jobs in openshop scheduling problem which should be processed by m machines. purpose ofscheduling open shop problem is attaining to a suitable order of processing jobs byspecified mach...

Journal: :Revista Internacional de Métodos Numéricos para Cálculo y Diseño en Ingeniería 2021

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علامه طباطبایی - دانشکده علوم اجتماعی 1389

the study aims to achieve research and testing of hypotheses survey techniques and questionnaires to collect information used. 61 questions in the questionnaire included 15 questions and 46 open questions according to research in the study population, girls and their mothers as the value of different children investment should be. mothers according to the research community benefits from havi...

Ali Khosrozadeh ghomi Azadeh Divsalar Behnam Barzegar, Homayun Motameni

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

Ali Khosrozadeh ghomi Azadeh Divsalar Behnam Barzegar, Homayun Motameni

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

Journal: :international journal of supply and operations management 2014
bahman naderi vahid roshanaei

in some industries as foundries, it is not technically feasible to interrupt a processor between jobs. this restriction gives rise to a scheduling problem called no-idle scheduling. this paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. the problem is first mathematically formulated by three different mixed integer linear programming...

2005
Si Cheng Min Tan

The cyclic permutation flow shop is one flow shop that repetitively produces product mix under permutation schedules. We propose that the cyclic permutation flow shop given the general job sequence can be modeled as a time event graph, based on which the mixed-integer programming method is applied to find the optimal schedule with maximum throughput. Two cases of cyclic permutation flow shops w...

پایان نامه :0 1371

the treatment of in completely formed pulpless teeth has presented considrable problems. these teeth have wide open apexes and the walls of the root canal diverge toward the apical tissues. mechanical preparation cannot be done in the normal manner beacause of the large initial size and the taper of apical part of the canal , a mechanical stop cannot be produced at the apex of the canal and , t...

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

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