This paper considers a production planning problem in disassembly systems, which is the problem of determining the quantity and timing of disassembling end-of-use/life products in order to satisfy the ...
This project implements a Branch and Bound (B&B) algorithm to solve the Agile Earth Observation Satellite Scheduling (AEOSS) problem — a complex NP-hard combinatorial optimization challenge. The ...
Abstract: Existing algorithms for the two-stage assembly scheduling problem (TASP) ignores the setup time and depends on four or more fine-tuned parameters. This work focuses on TASPs with separated ...
This repository contains code relating to the paper "A Combinatorial Branch-and-Bound Algorithm for the Capacitated Facility Location Problem under Strict Customer Preferences" by Christina Büsing, ...
The "branch-and-bound" algorithm for the exact solution of a three-machine scheduling problem proposed by Lomnicki has been generalized to the case of an arbitrary number of machines (under the ...
Abstract: We propose an algorithm that exactly solves the cardinality-constrained sparse spectral unmixing problem. Based on recent works on $\ell_{0}$-norm exact optimization, a branch-and-bound ...
ABSTRACT: For solving assignment problems of staff, equipment and task in engineering support action, a 3-Dimensional assignment model is established, which contains staff skill level, equipment ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results