All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 6 Next

Displaying 101 – 120 of 1566

Showing per page

A new algorithm for optimal solution of fixed charge transportation problem

Nermin Kartli, Erkan Bostanci, Mehmet Serdar Guzel (2023)

Kybernetika

Fixed charge transportation problem (FCTP) is a supply chain problem. In this problem, in addition to the cost per unit for each transported product, a fixed cost is also required. The aim is to carry out the transportation process at the lowest possible cost. As with all supply chain problems, this problem may have one, two, or three stages. An algorithm that can find the optimal solution for the problem in polynomial time is not known, even if it is a single-stage problem. For this reason, new...

A new any-order schedule generation scheme for resource-constrained project scheduling

Cyril Briand (2009)

RAIRO - Operations Research

In this paper, a new schedule generation scheme for resource-constrained project scheduling problems is proposed. Given a project scheduling problem and a priority rule, a schedule generation scheme determines a single feasible solution by inserting one by one each activity, according to their priority, inside a partial schedule. The paper proposes a generation scheme that differs from the classic ones in the fact that it allows to consider the activities in any order, whether their predecessors...

A new efficient and flexible algorithm for the design of testable subsystems

Stéphane Ploix, Abed Alrahim Yassine, Jean-Marie Flaus (2010)

International Journal of Applied Mathematics and Computer Science

In complex industrial plants, there are usually many sensors and the modeling of plants leads to lots of mathematical relations. This paper presents a general method for finding all the possible testable subsystems, i.e., sets of relations that can lead to various types of detection tests. This method, which is based on structural analysis, provides the constraints that have to be used for the design of each detection test and manages situations where constraints contain non-deductible variables...

A new formulation for scheduling unrelated processor under precedence constraints

Nelson Maculan, Stella C.S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza (2010)

RAIRO - Operations Research

We give a new formulation for the problem of task scheduling into unrelated processors under precedence constraints. This formulation has a polynomial number of variables and does not require that the processing times be integer valued.

Currently displaying 101 – 120 of 1566