نتایج جستجو برای: earliness and tardiness penalties
تعداد نتایج: 16827720 فیلتر نتایج به سال:
We consider a special class of resource-constrained single machine scheduling problems. In the classical context, resource types are classified into renewable and non-renewable; however, large variety real-world problems may not fit one these classes, e.g. labour regulations in project scheduling, budget allocation to different phases construction project, dose management medical imaging centre...
In this paper, we present a genetic algorithm approach that considers the single machine scheduling problem. There are n jobs, in which each job j ( 1 2 j n = , ,..., ) has a normal processing time j p , a due date j d , earliness penalty j α , and tardiness penalty j β . The objective is to find the sequence of jobs that minimizes the weighted sum of earliness and tardiness penalty costs, with...
This study considers the job scheduling problem of minimizing the Weighted Waiting Time Variance (WWTV) of jobs. It is an extension of WTV minimization problems in which we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of their waiting times is minimized. WWTV minimization finds its applications for job scheduling in manufacturing systems with e...
This paper considers common due-date assignment and scheduling on parallel machines. The main decisions are: (a) deter-mining the common due-date; (b) allocating jobs to machines; and (c) sequencing the jobs assigned to each machine. The objective is to minimize the sum of the penalties associated with common due-date assignment, earliness and tardiness. As an extension of the existing studies ...
Many firms have to deal with the problems of scheduling and transportation allocation. The problems of assembly scheduling mainly focus on how to arrange orders in proper sequence on the assembly line with the purpose of minimizing the maximum completion time before they are flown to their destinations. Transportation allocation problems arise in how to assign processed orders to transport mode...
In this paper, a discrete artificial bee colony (DABC) algorithm is proposed to solve the lotstreaming flow shop scheduling problem with the criterion of total weighted earliness and tardiness penalties under both the idling and no-idling cases. Unlike the original ABC algorithm, the proposed DABC algorithm represents a food source as a discrete job permutation and applies discrete operators to...
We study problems of scheduling n unit-time jobs on m identical parallel machines, in which a common due window has to be assigned to all jobs. If a job is completed within the due window, then no scheduling cost incurs. Otherwise, a job-dependent earliness or tardiness cost incurs. The job completion times, the due window location and the size are integer valued decision variables. The objecti...
As the resource constrained project scheduling problem (RCPSP) has a wide range of applications, its models, extensions and algorithms have been intensively studied [2]. As for objective functions, makespan minimization has commonly been used, while the importance of non-regular ones such as earliness-tardiness are also recognized. In this paper, we introduce a time-lag cost, which is charged a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید