Results 171 to 180 of about 1,705 (196)

Matheuristics for Qualification Management Decisions in Wafer Fabs

IEEE transactions on semiconductor manufacturing, 2020
In this paper, a qualification management problem arising in semiconductor wafer fabrication facilities (wafer fabs) is studied. The stepper machines, a common bottleneck in many wafer fabs, must be qualified to process lots of different families.
Denny Kopp, L. Mönch
semanticscholar   +1 more source

Matheuristics for solving the Multiple Knapsack Problem with Setup

Computers & industrial engineering, 2019
The knapsack problem is one of the most investigated and applicable combinatorial optimization problems. In this paper we consider a generalized problem called the Multiple Knapsack Problem with Setup (MKPS) in which a set of families of items and a set ...
Rahma Lahyani, Khalil Chebil, Mahdi Khemakhem, Leandro C. Coelho   +3 more
semanticscholar   +1 more source

A matheuristic for the truck and trailer routing problem

European Journal of Operational Research, 2013
In the truck and trailer routing problems (TTRPs) a fleet of trucks and trailers serves a set of customers. Some customers with accessibility constraints must be served just by truck, while others can be served either by truck or by a complete vehicle (a truck pulling a trailer).
Juan G. Villegas, Christian Prins, Caroline Prodhon, Andrés L. Medaglia, Nubia Velasco   +4 more
openaire   +3 more sources

Multi-level predictive maintenance of smart manufacturing systems driven by digital twin: A matheuristics approach

Journal of manufacturing systems, 2023
Qiang Feng, Yue Zhang, Bo Sun, Xing Guo, Donming Fan, Yi Ren, Yanjie Song, Zili Wang   +7 more
semanticscholar   +1 more source

Solving Binary Cutting Stock with Matheuristics

2014
Many Combinatorial Optimization (CO) problems are classifed as NP - complete problems. The process of solving CO problems in an efficient manner is important since several industry, government and scientific problems can be statedin this form. This work presents a benchmark of three different methodologies to solve the Binary Cutting Stock (BCS ...
Ivan Adrian Lopez Sanchez, Jaime Mora-Vargas, Cipriano A. Santos, Miguel González-Mendoza 0001   +3 more
openaire   +1 more source

Matheuristics for a Multi-Day Electric Bus Assignment and Overnight Recharge Scheduling Problem

Social Science Research Network, 2023
P. Vendé, G. Desaulniers, Y. Kergosien, Jorge E. Mendoza   +3 more
semanticscholar   +1 more source

A Matheuristic Approach for the p-Cable Trench Problem

2016
The p-Cable Trench Problem is a telecommunications network design problem, which jointly considers cable and trench installation costs and addresses the optimal location of p facilities. In this work, a matheuristic approach based on the POPMUSIC (Partial Optimization Metaheuristic under Special Intensification Conditions) framework is developed.
Eduardo Lalla-Ruiz, Silvia Schwarze, Stefan Voß 0001   +2 more
openaire   +1 more source

Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness

Computers & Operations Research, 2022
B. Prata, Victor Fernandez-Viagas, J. Framiñán, C. Rodrigues   +3 more
semanticscholar   +1 more source

Efficient matheuristics to solve a rich production-routing problem

Computers & industrial engineering, 2022
Allexandre Fortes, R. Camargo, Leandro Reis Muniz, F. M. S. Lima, Fernanda dos Reis Cota   +4 more
semanticscholar   +1 more source

A Matheuristic Approach for the University Carpooling Problem.

2012
The carpooling problem consists of a shared use of private cars. Typically it is organized by a large company for encouraging its employees to pick up their colleagues minimizing the number of private cars travelling to/from the company site. The core of the efficient management of such a service is to find an optimal matching between the users and ...
BRUGLIERI, MAURIZIO, COLORNI VITALE, ALBERTO, T. Davidovic, S. Roksandic   +3 more
openaire   +1 more source