نتایج جستجو برای: number of tardy job
تعداد نتایج: 21185948 فیلتر نتایج به سال:
Most deterministic machine scheduling models assume that the processing time of a job on a machine is fixed externally and known in advance of scheduling. However, in most realistic situations, apart from the machines, it requires additional resources to process jobs, and the processing time of a job is determined internally by the amount of the resources allocated. In these situations, both th...
Harrington and Soare introduced the notion of an n-tardy set. They showed that there is a nonempty E property Q(A) such that if Q(A) then A is 2tardy. Since they also showed no 2-tardy set is complete, Harrington and Soare showed that there exists an orbit of computably enumerable sets such that every set in that orbit is incomplete. Our study of n-tardy sets takes off from where Harrington and...
the present study was an attempt to conduct a contrastive analysis between general english (ge) and english for specific purposes (esp) texts in terms of cohesion and cohesive devices. to this end, thirty texts from different esp and ge textbooks were randomly selected. then they were analyzed manually to find the frequency of cohesive devices. cohesive devices include reference, substitution, ...
this study purported to compare and contrast the use of self-mention and evidentials as two mtadiscourse features in opinion columns of persian and english newspapers. the theoretical basis of this study is the idea that metadiscourse features vary across cultural boundaries. for this purpose, 150 persian and 150 english opinion columns were collected based on three factors of topic, audience a...
we have two part in this thesis, at first: the interaction of native calf thymus dna (ct-dna) with two anthraquinones including quinizarin (1,4- dihydroxy anthraquinone) and danthron (1,8- dihydroxy anthraquinone) in a mixture of 0.04 m brittone-robinson buffer and 50% of ethanol were studied at physiological ph by uv-vis absorption, florescence, circular dichroism spectroscopic methods, viscos...
We consider the solution of some NP-hard parallel machine scheduling problems involving minimization weighted or unweighted number tardy jobs. first show that these cannot be approximated in polynomial time. Then we propose exponential-time approximation algorithms and fixed parameter tractable exact to solve them.
Background. In setting a problem of minimizing total weighted tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input data: job release dates given in either ascending or descending order. It was recently ascertained that scheduling few equal-length jobs is expectedly faster order, whereas 30 70 1.5 % 2.5 For number between roughly 90...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید