Results 41 to 50 of about 1,705 (196)

Total Tardiness Minimization in a Single-Machine with Periodical Resource Constraints

open access: yesJurnal Optimasi Sistem Industri, 2022
In this paper we introduce a variant of the single machine considering resource restriction per period. The objective function to be minimized is the total tardiness.  We proposed an integer linear programming modeling based on a bin packing formulation.
Bruno Prata   +2 more
doaj   +1 more source

Formulating and Solving Routing Problems on Quantum Computers

open access: yesIEEE Transactions on Quantum Engineering, 2021
The determination of vehicle routes fulfilling connectivity, time, and operational constraints is a well-studied combinatorial optimization problem. The NP-hard complexity of vehicle routing problems has fostered the adoption of tailored exact approaches,
Stuart Harwood   +5 more
doaj   +1 more source

Hybrid matheuristics for the multi-capacitated clustering problem

open access: yesRAIRO Oper. Res., 2022
The capacitated clustering problem is a well-known and largely studied combinatorial optimization problem with several industrial applications. Although a great attention has been paid to this problem in the literature, the deeming of the problem with ...
K. Araújo, Jedson Guedes, B. Prata
semanticscholar   +1 more source

A Matheuristic for Joint Optimal Power and Scheduling Assignment in DVB-T2 Networks

open access: yesAlgorithms, 2020
Because of the introduction and spread of the second generation of the Digital Video Broadcasting—Terrestrial standard (DVB-T2), already active television broadcasters and new broadcasters that have entered in the market will be required to (re ...
Fabio D’Andreagiovanni   +2 more
doaj   +1 more source

Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: Application in the offshore oil and gas industry [PDF]

open access: yesComputers & Operations Research, 2020
In this paper, we address a variant of a batch scheduling problem with identical parallel machines and non-anticipatory family setup times to minimize the total weighted completion time.
Victor Abu-Marrul   +3 more
semanticscholar   +1 more source

Comparing Local Search Algorithms for the Beam Angles Selection in Radiotherapy

open access: yesIEEE Access, 2018
One important problem in radiation therapy for cancer treatment is the selection of the set of beam angles radiation will be delivered from. A primary goal of this problem is to find a beam angle configuration (BAC) that leads to a clinically acceptable ...
Guillermo Cabrera-Guerrero   +5 more
doaj   +1 more source

Optimal Power Flow Problem Solution Through a Matheuristic Approach

open access: yesIEEE Access, 2021
The optimal power flow (OPF) problem is a widely studied subject in the literature that has been solved through classical and metaheuristic optimization techniques.
Juan M. Home-Ortiz   +2 more
doaj   +1 more source

A fix-and-optimize matheuristic for university timetabling [PDF]

open access: yesJournal of Heuristics, 2018
University course timetabling covers the task of assigning rooms and time periods to courses while ensuring a minimum violation of soft constraints that define the quality of the timetable. These soft constraints can have attributes that make it difficult for mixed-integer programming solvers to find good solutions fast enough to be used in a practical
Michael Lindahl   +2 more
openaire   +2 more sources

A matheuristic for the stochastic facility location problem

open access: yesJournal of Heuristics, 2021
In this paper, we describe a matheuristic to solve the stochastic facility location problem which determines the location and size of storage facilities, the quantities of various types of supplies stored in each facility, and the assignment of demand locations to the open facilities, which minimize unmet demand and response time in lexicographic order.
Renata Turkes   +2 more
openaire   +2 more sources

Optimizing Two-Dimensional Irregular Packing: A Hybrid Approach of Genetic Algorithm and Linear Programming

open access: yesApplied Sciences, 2023
The problem of two-dimensional irregular packing involves the arrangement of objects with diverse shapes and sizes within a given area. This challenge arises across various industrial sectors, where effective packing optimization can yield cost savings ...
Cheng Liu, Zhujun Si, Jun Hua, Na Jia
doaj   +1 more source

Home - About - Disclaimer - Privacy