نتایج جستجو برای: routing and lateness penalties a mixed
تعداد نتایج: 20370985 فیلتر نتایج به سال:
In this study, a two echelons supply chain system in which a supplier is producing perishable product and distribute it to multiple customers is considered. By allowing lateral transshipment mechanism, it is also possible to deliver products to some customers in some periods in bulk, then customers using their own vehicle to transship goods between each other seeking further reduction in the ov...
the location-routing problem is a relatively new branch of logistics system. its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. in this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. another important issue in this regard ...
This paper considers a single-sourcing network design problem for a three-level supply chain. For the first time, a novel mathematical model is presented considering risk-pooling, the inventory existence at distribution centers (DCs) under demand uncertainty, the existence of several alternatives to transport the product between facilities, and routing of vehicles from distribution centers to c...
Because of the nature of conventional 0-1 part-family incidence matrix, a multi-cell flexible manufacturing systems (MCFMS) using conventional part-family formation algorithms, such as array-based clustering, similarity coefficient-based clustering, and mathematical programming, in a cellular manufacturing mode can assign a part family only to one machine cell. The consequence is that each part...
in this thesis, first the notion of weak mutual associativity (w.m.a.) and the necessary and sufficient condition for a $(l,gamma)$-associated hypersemigroup $(h, ast)$ derived from some family of $lesssim$-preordered semigroups to be a hypergroup, are given. second, by proving the fact that the concrete categories, semihypergroups and hypergroups have not free objects we will introduce t...
We develop an O (q2n + nlogn) algorithm to obtain a preemptive schedule that minimizes maximum lateness when n jobs with given due dates and memory requirements are to be scheduled on m processors (n ≥ m) of given memory sizes. q is the number of distinct due dates. The value of the minimum maximum lateness can itself be found in O(qn + nlogn) time.
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
We consider the uniform parallel machine scheduling problem with the objective of minimizing maximum lateness. We show that an extension of the EDD rule to a uniform parallel machine setting yields a maximum lateness value which does not exceed the optimal value by more than pmax, where pmax is the maximum job processing time. c © 2000 Elsevier Science B.V. All rights reserved.
extensive research has been devoted to resource constrained project scheduling problem. however, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. in this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
1. to determine whether difference in birth body mass influenced growth performance in pipistrellus kuhlii we studied a total of 12 captive-born neonates. bats were assigned to two body mass groups: light birth body mass (lbw: 0.89 ± 0.05, n=8) and heavy birth body mass (hbw: 1.35 ± 0.08, n=4). heavier body mass at birth was associated with rapid postnatal growth (body mass and forearm length) ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید