نتایج جستجو برای: earliness

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

Journal: :International Journal of Production Research 2009

Journal: :European Journal of Operational Research 2014
Kenneth R. Baker

We address the single-machine stochastic scheduling problem with an objective of minimizing total expected earliness and tardiness costs, assuming that processing times follow normal distributions and due dates are decisions. We develop a branch and bound algorithm to find optimal solutions to this problem and report the results of computational experiments. We also test some heuristic procedur...

2005
Han Hoogeveen

In this paper we give a survey of the most important results on multicriteria scheduling that have appeared in the literature or are to appear. We provide an extensive introduction including two example problems and then discuss the relevant literature. Here we pay special attention to the area of earliness-tardiness scheduling, scheduling with controllable processing times, simultaneous approx...

Journal: :Plant physiology 1972
P J Kuiper B Stuiver

Long chain cyclopropane fatty acids were observed in the sulfolipid fraction extracted from leaves of the early spring plants Galanthus nivalis L. and Anthriscus silvestris L. (Hoffm.). The content of cyclopropane fatty acids with 25 carbon atoms appeared to be clearly correlated with earliness in spring, and it ranged from 68% (G. nivalis L., snow drop) to 0.5% (wheat). Several long chain cycl...

2004
Francis Sourd

The one-machine scheduling problem with sequence-dependent setup times and costs and earliness-tardiness penalties is addressed. This problem is NP-complete, so that local search approaches are very useful to efficiently find good feasible schedules. In this paper, we present an extension of the dynasearch neighborhood for this problem. Finding the best schedule in this neighborhood is shown to...

Journal: :international journal of industrial engineering and productional research- 0
r. tavakolimoghadam m. vasei

in this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/i/etmax). due to the time complexity function, this sequencing problem belongs to a class of np-hard ones. thus, a special design of a simulated annealing (sa) method is applied to solve such a hard problem. to comp...

Journal: :Genetics 2002
Agnès Bouchez Frédéric Hospital Mathilde Causse André Gallais Alain Charcosset

This article reports the marker-assisted introgression of favorable alleles at three quantitative trait loci (QTL) for earliness and grain yield among maize elite lines. The QTL were originally detected in 1992 by means of ANOVA in a population of 96 recombinant inbred lines (RILs). Introgression started from a selected RIL, which was crossed three times to one of the original parents and then ...

2017
Paola Crinò Mario Augusto Pagnotta Michael Wink

Ten Italian globe artichoke clones belonging to the Romanesco typology were characterized in the western coastal area of Italy (Cerveteri, Rome), using a combination of morphological (UPOV descriptors), biochemical (HPLC analysis), and molecular (AFLP, ISSR, and SSR markers) traits. Significant differences among clones were found for many of the quantitative and qualitative morphological traits...

Journal: :Plant physiology 2003
Silvia Gazzani Anthony R Gendall Clare Lister Caroline Dean

Allelic variation at the FRI (FRIGIDA) and FLC (FLOWERING LOCUS C) loci are major determinants of flowering time in Arabidopsis accessions. Dominant alleles of FRI confer a vernalization requirement causing plants to overwinter vegetatively. Many early flowering accessions carry loss-of-function fri alleles containing one of two deletions. However, some accessions categorized as early flowering...

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

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