نتایج جستجو برای: total weighted earliness
تعداد نتایج: 891369 فیلتر نتایج به سال:
This paper surveys the literature related to solving traditional unrelated parallel-machine scheduling problems. It compiles algorithms for the makespan, total weighted sum of completion times, maximum tardiness, total tardiness, total earliness and tardiness, and multiple criteria performance measures. The review of the existing algorithms is restricted to the deterministic problems without se...
This paper investigates the single-machine due-window assignment scheduling with truncated learning effects and past-sequence-dependent setup times simultaneously. The scheduler has option of job-rejection, i.e., some jobs are processed other rejected. Under three (i.e., common, slack different) methods, our goal is to minimize sum a general earliness-tardiness cost weighted earliness-tardiness...
The problem of determining a schedule of jobs with unit time lengths on a single machine that minimizes the total weighted earliness and tardiness penalties with respect to arbitrary rational due dates is formulated as an integer programming problem We show that if the penalties meet a certain criterion called the Dominance Condition then there exists an extremal optimal solution to the LP rela...
The parallel machine scheduling problem is an important and difficult problem to be considered in the real-world situations. Traditionally, this problem consists of the scheduling of a set of independent jobs on parallel machines with the aim of minimizing the maximum job completion. In today's manufacturing systems, in which both early and tardy finishing of job processing are undesired, the o...
The single-machine early/tardy (E/T) scheduling problem is addressed in this research. The objective of this problem is to minimize the total amount of earliness and tardiness. Earliness and tardiness are weighted equally and the due date is common and large (unrestricted) for all jobs. Machine setup time is included and is considered sequence-dependent. When sequence-dependent setup times are ...
This paper considers the problem of linding an optimal schedule and a common due date for a set of jobs, in a static single machine system. The scheduling criterion is the minimization of the weighted sum of earliness and tardiness values. Different weights are considered as the earliness penalty and tardiness penalty, for each job. A branching procedure is presented for finding an optimal solu...
This paper proposes exact algorithms to generate optimal timing schedules for a given sequence of operations in job shops minimize the total weighted earliness and tardiness. The are proposed two shop scheduling scenarios, one involving due dates only last operation each other all on jobs. Computational experiments benchmark problem instances reveal that, case scenario job, faster than those ge...
Original scientific paper This paper presents a hybrid genetic algorithm for assembly flow-shop scheduling problem with sequence-dependent setup and transportation times, with objectives, namely the minimizing of weighted, sum of total weighted squared tardiness, makespan, and total weighted squared earliness and number of tardy jobs. Since the problem is NP-hard, we solved this problem by hybr...
this paper considers a two-stage assembly flow shop problem (tafsp) where m machines are in the first stage and an assembly machine is in the second stage. the objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. jit seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید