نتایج جستجو برای: number of tardy job
تعداد نتایج: 21185948 فیلتر نتایج به سال:
Consider a single machine and a set of jobs that are available for processing at time 0. Job has a processing time , a due date and a weight . We consider bi-criteria scheduling problems involving the maximum weighted tardiness and the number of tardy jobs. We give NPhardness proofs for the scheduling problems when either one of the two criteria is the primary criterion and the other one is the...
In this paper, we propose a multi-criteria machine-schedules decision making method that can be applied to a production environment involving several unrelated parallel machines and we will focus on three objectives: minimizing makespan, total flow time, and total number of tardy jobs. The decision making method consists of three phases. In the first phase, a mathematical model of a single mach...
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
This paper addresses the job shop scheduling problem to minimize the number of tardy jobs, considering the sequence dependent setup time. This problem is taken as a sequencing problem, and a family of approaches with different levels of intricacy is proposed. The simplest form is a critical ratio-based dispatching rule, which leads to satisfactory solutions by taking into account the group info...
We investigate the problem of minimizing the weighted number of tardy jobs on a single machine subject to availability constraints. We consider the case of semi-resumable jobs (1, hk|ri, sr − a| ∑ wiUi). We show that the problem is equivalent to a similar problem without availability constraints, but where the processing times of jobs are a stepwise function of their starting time. We design a ...
this thesis basically deals with the well-known notion of the bear-invariant of groups, which is the generalization of the schur multiplier of groups. in chapter two, section 2.1, we present an explicit formula for the bear-invariant of a direct product of cyclic groups with respect to nc, c>1. also in section 2.2, we caculate the baer-invatiant of a nilpotent product of cyclic groups wuth resp...
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...
to explore the idea the investingation proposed, aimed at finding whether the performances of the population of iranians students studying english in an efl context are consistent in l1 and l2 writing taks and whether there is a cross-linguistic transfer in this respect. in this regard the subjects were instructed to write four compositions-two in english and two in farsi-which consisted of an ...
In this paper we deal with a variant of the Job Shop Scheduling Problem. We consider the addition of release dates and deadlines to be met by all jobs. The objective is makespan minimization if there are no tardy jobs, and tardiness minimization otherwise. The problem is approached by using a Shifting Bottleneck strategy. The presence of deadlines motivates an iterative use of a particular one ...
one of the most important number sequences in mathematics is fibonacci sequence. fibonacci sequence except for mathematics is applied to other branches of science such as physics and arts. in fact, between anesthetics and this sequence there exists a wonderful relation. fibonacci sequence has an importance characteristic which is the golden number. in this thesis, the golden number is observed ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید