نتایج جستجو برای: maximum tardiness criterion
تعداد نتایج: 367367 فیلتر نتایج به سال:
Scheduling problems involving both earliness and tardiness costs became more important in recent years. This kind of problems include both earliness and tardiness penalties and tries to reduce them. In this study a case study from real world is investigated. Since the machine is bottle neck in the production line and all jobs have a common restrictive due date and different earliness and tardin...
The objective of this paper is to propose a scheduling problem for multiple automated guided vehicles (AGVs) in a manufacturing system. Considering the due date of AGVs requiring for material handling among shops in a job shop layout, their earliness and tardiness are significant in satisfying the expected cycle time and from an economic view point. Earliness results in AGVs waiting and tardine...
Two optimal algorithms, MTA* and MT-RBA*, are presented to find the optimal yard crane (YC) job sequence for serving a fleet of vehicles for delivery and pickup jobs with scheduled deadlines and predicted vehicle arrival times. The objective is to minimize the total tardiness of incoming vehicle jobs. This is important for minimizing vessel turnaround time. In the search for an optimal job sequ...
In this paper we study the resource-constrained project scheduling problem with weighted earliness-tardiness penalty costs. Project activities are assumed to have a known deterministic due date, a unit earliness as well as a unit tardiness penalty cost and constant renewable resource requirements. The objective is to schedule the activities in order to minimize the total weighted earliness-tard...
In this research paper, n jobs have to be scheduled on one-machine minimize the sum of maximum earliness and tardiness. We solved a series bi-criteria scheduling problems that related Three new algorithms were presented, two for hierarchical objective one simultaneous objective. Using results these algorithms, we This considered as NP-hard problem, it is also irregular, so missed some helpful p...
The objective of this paper is to propose a scheduling problem for multiple automated guided vehicles (AGVs) in a manufacturing system. Considering the due date of AGVs requiring for material handling among shops in a job shop layout, their earliness and tardiness are significant in satisfying the expected cycle time and from an economic view point. Earliness results in AGVs waiting and tardine...
A new type of tardy cost, called stepwise tardiness, is considered in a single machine problem. The stepwise tardiness scheduling has been found in many practical situations. To the best of our knowledge, there exist few studies directly addressing the problem. In this paper, we develop a heuristic for the single machine total stepwise tardiness (SMTST) problem. In addition, a variable neighbor...
This paper presents a simulation model of a flexible manufacturing system (FMS) which subjects to minimization three performance criteria simultaneously such as mean flow time, mean tardiness, and mean earliness. The dispatching rule will be changed at a frequency that is varied by the number of outputs produced by the system. Therefore, the dynamic nature is event-triggered rather than changin...
We consider the problem of allocating a single server to families of jobs with random service times and due dates. Furthermore, a setup is required when the server switches from one job family to another. We address the problems of minimizing expected weighted ow time, expected maximum lateness, and total weighted tardiness with emphasis on problems for which it is assumed that each family can ...
This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید