نتایج جستجو برای: Intermediate due date
تعداد نتایج: 1197513 فیلتر نتایج به سال:
the present study aimed to investigate the possible effects of focused highlighted error feedback on grammatical accuracy of writing among iranian intermediate efl learners. after selecting 52 homogenous participants from among 70 university students attending azad university of rasht and randomly dividing them into two intact groups of 26 students, the researcher exposed the participants of th...
This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...
this study was intended to analyze the listening tapescripts of the elementary and pre-intermediate levels of total english textbooks from the pragmatic dimension of language functions and speech acts in order to see whether the listening tasks are pragmatically informative or not. for this purpose, 8 conversations from the two books were selected randomly, and then, the two pragmatic models of...
A method is described to assign product due dates for multistage assemblies with uncertain manufacturing and assembly process times. Earliest start times of operations are specified by a predetermined production plan and processing time distributions for operations are truncated at minimum processing times. The method systematically decomposes the complex product structures of multistage assemb...
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence independent setup time precedes the processing of each group. All jobs have a common fixed due date, which can be either unrestrictively large or restrictively small. The objective is to minimize the total weighted earlin...
We propose a heuristic procedure that constructs a schedule for N jobs with stochastic processing times and a common due date on M parallel, identical machines. The criterion is the minimization of the total expected incompletion cost. A worst-case analysis for the ratio of the heuristic and optimal solutions is presented and a bound on the ratio is derived. The experimental results presented i...
The Due-Date Bargainer is a useful tool to support negotiation on due-dates between a manufacturer and its customers. To improve the computational performance of an earlier version of the Due-Date Bargainer, we present a new soft computing approach. It uses a genetic algorithm to nd the best priority sequence of customer orders for resource allocation and fuzzy logic operations to allocate the ...
This paper proposes an iterative bidding framework for integrated due date management decision making. We focus on a type of make-to-order environment, in which a firm needs to quote due dates and prices and to schedule the production of a variety of job orders required by a large group of customers. In most cases, customers prefer shorter due dates. However, given limited production capacity a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید