73 research outputs found
A simplified implementation of the least squares solution for pairwise comparisons matrices
This is a follow up to "Solution of the least squares method problem of pairwise comparisons matrix" by Bozóki published by this journal in 2008. Familiarity with this paper is essential and assumed. For lower inconsistency and decreased accuracy, our proposed solutions run in seconds instead of days. As such, they may be useful for researchers willing to use the least squares method (LSM) instead of the geometric means (GM) method
Solving a Discrete Lot Sizing and Scheduling Problem with Unrelated Parallel Machines and Sequence Dependent Setup Using a Generic Decision Support Tool
In any manufacturing systems, planning and scheduling are not intuitive. Some dedicate tools may exist to help some specific companies to daily plan and assign their activities. Our purpose is to develop a generic decision support tool to solve any planning or scheduling problems. To do so, we use a hybridization between a metaheuristic and a list algorithm. The metaheuristic is generic to any studied problems. The list algorithm needs to be specific to the considered problem. The use of our tool needs a minimum work development. In this paper, our proposal is illustrated by the case study of a textile company which intends to schedule its production, by assigning it resources and dates. This problem can be seen as a Discrete Lot Sizing and scheduling Problem (DLSP)
Optimizing link rate assignment and transmission scheduling in WMN through compatible set generation
Challenges in Dimensioning of an Optimized Thermoelectric Generator for Waste Heat Recovery in Cars
A Branch-and-Price Algorithm for the Integrated Berth Allocation and Quay Crane Assignment Problem
- …