نتایج جستجو برای: open shop with no buffer
تعداد نتایج: 10478941 فیلتر نتایج به سال:
abstract this study set out to compare the effect of modality of presentation (subtitled vs. auditory) in the comprehension of verbal content of documentary films among iranian efl students. to this end, (30 male 30 female) students were chosen from two schools. after their homogeneity was established, the students attended the listening sessions to watch five documentary films over t...
Genetic algorithms are a very popular heuristic which have been successfully applied to many optimization problems within the last 30 years. In this chapter, we give a survey on some genetic algorithms for shop scheduling problems. In a shop scheduling problem, a set of jobs has to be processed on a set of machines such that a specific optimization criterion is satisfied. According to the restr...
We investigate the multiprocessor multi stage open shop scheduling problem In this variant of the open shop model there are s stages each consisting of a number of parallel identical machines Each job consists of s operations one for each stage that can be executed in any order The goal is to nd a non preemptive schedule that minimizes the makespan We derive two approximation results for this N...
In this paper we consider a generalized version of the classical preemptive open shop problem with sum of weighted job completion times objective. The main result is a (2 + ε)-approximation algorithm for this problem. In the last section we also discuss the possibility of improving our algorithm.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید