Search
Now showing items 11-20 of 26
Improving blood products supply through donation tailoring
(Elsevier, 2019-02)
Recent technological advances, called Multicomponent Apheresis, allow tailoring the blood donations based on the demand and current inventory levels of blood products. Different from the most common type of blood donation ...
An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics
(Elsevier, 2019-11)
In this paper, we analyze a variant of the unrelated parallel machine scheduling problem with the objective of minimizing the total tardiness and earliness in the presence of sequence-dependent setups, unequal release ...
Bin packing problem with conflicts and item fragmentation
(Elsevier, 2021-02)
In this paper, we study the Bin Packing Problem with Conflicts and Item Fragmentation (BPPC-IF) which has applications in the delivery and storage of items that cannot be packed together. Given a set of items each with a ...
Supplier selection and order allocation in the presence of suppliers with exact annual capacity
(Inderscience Enterprises Ltd., 2021)
In this paper, we focus on the supplier selection and order quantity allocation for a single retailer. The retailer orders a product from multiple suppliers with capacities, adds value to the product and fulfils the demand ...
A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem
(Elsevier, 2022-10)
Households produce large amounts of waste cooking oil (WCO), which should be disposed properly to avoid its negative impacts on the environment. Using WCO as raw material in biodiesel production is an effective disposal ...
Genetic algorithms and heuristics hybridized for software architecture recovery
(Springer, 2023-06-26)
Large scale software systems must be decomposed into modular units to reduce maintenance efforts. Software Architecture Recovery (SAR) approaches have been introduced to analyze dependencies among software modules and ...
A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
(Elsevier, 2023-08-01)
In this paper, we study the Variable-Sized Bin Packing Problem with Conflicts (VSBPPC). In VSBPPC, a set of items each with a certain size has to be packed into bins of various types. Bin types differ in terms of their ...
Variable-sized bin packing problem with conflicts and item fragmentation
(Elsevier, 2022-01)
In this paper, we study the Variable-Sized Bin Packing Problem with Conflicts and Item Fragmentation (VSBPPC-IF) that has applications such as (i) the delivery planning of incompatible items using a fleet of heterogenous ...
Humanitarian relief supplies distribution: an application of inventory routing problem
(Springer, 2019-12)
In this paper, we study the distribution of humanitarian relief supplies. In humanitarian relief, supplies including food, water and medication are received in batches/waves from the suppliers and the donors. Then, these ...
A two-phase heuristic algorithm for the label printing problem
(Springer, 2023-04)
In this paper, we study the label printing problem (LPP) which has applications in the printing industry. In LPP, the demand for a set of labels is satisfied by printing the labels using templates with multiple slots. Given ...
Share this page