Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem

2006 ◽  
pp. 19-30
Author(s):  
Davide Bilò ◽  
Luciano Gualà ◽  
Guido Proietti
Keyword(s):  
Bicriteria Problem

A bicriteria problem of synthesizing optimal object flow service policies

2013 ◽  
Vol 46 (9) ◽  
pp. 1346-1351
Author(s):  
Dmitriy I. Kogan ◽  
Anastasia S. Kuimova ◽  
Yuriy S. Fedosenko
Keyword(s):  
Service Policies ◽  
Bicriteria Problem

scholarly journals Bicriteria problem of discrete optimization in planning a multiunit construction project

2018 ◽  
Vol 174 ◽  
pp. 04008
Author(s):  
Michał Podolski
Keyword(s):  
Discrete Optimization ◽  
Construction Projects ◽  
Flow Shop ◽  
Discrete Optimization Problem ◽  
Early Completion ◽  
Proposed Model ◽  
Construction Contractor ◽  
Flow Shop Problem ◽  
Bicriteria Problem ◽  
The Cost

The paper describes the bicriteria discrete optimization problem, that may occur during the scheduling of multiunit construction projects. The multiunit project involves the construction of many civil structures with the same sets of activities needed, but different in size. In the project the deadlines of activities in units are adopted. The missing of them by the contractor causes the payment of the disincentive penalty. The early completion of the activities in units is rewarded extra income for the construction contractor i.e. a incentive bonus. Changing the order of the execution of the units changes the value of the objective functions: the duration of the project and the cost (the sum of the disincentive penalties and incentive bonuses). The proposed model of the project is the bicriteria NP-hard flow shop problem with constraints characteristic for construction projects. The paper presents the method of determining the set of Paretooptimal solutions for small projects. The computational example of the model of the project is also included in the paper.

scholarly journals SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION

2009 ◽  
Vol 20 (02) ◽  
pp. 247-269 ◽  
Author(s):  
NATALIA V. SHAKHLEVICH ◽  
AKIYOSHI SHIOURA ◽  
VITALY A. STRUSEVICH
Keyword(s):  
Single Machine ◽  
Single Machine Scheduling ◽  
Feasible Region ◽  
Controllable Processing Times ◽  
Linear Programs ◽  
Submodular Optimization ◽  
Processing Times ◽  
Single Criterion ◽  
Bicriteria Problem

In scheduling with controllable processing times the actual processing time of each job is to be chosen from the interval between the smallest (compressed or fully crashed) value and the largest (decompressed or uncrashed) value. In the problems under consideration, the jobs are processed on a single machine and the quality of a schedule is measured by two functions: the maximum cost (that depends on job completion times) and the total compression cost. Our main model is bicriteria and is related to determining an optimal trade-off between these two objectives. Additionally, we consider a pair of associated single criterion problems, in which one of the objective functions is bounded while the other one is to be minimized. We reduce the bicriteria problem to a series of parametric linear programs defined over the intersection of a submodular polyhedron with a box. We demonstrate that the feasible region is represented by a so-called base polyhedron and the corresponding problem can be solved by the greedy algorithm that runs two orders of magnitude faster than known previously. For each of the associated single criterion problems, we develop algorithms that deliver the optimum faster than it can be deduced from a solution to the bicriteria problem.

A BICRITERIA PROBLEM OF OPTIMAL SERVICE CENTERS LOCATION

2006 ◽  
Vol 39 (3) ◽  
pp. 425-429
Author(s):  
Alexander A. Kolokolov ◽  
Lidia A. Zaozerskaya
Keyword(s):  
Optimal Service ◽  
Bicriteria Problem
Sign in / Sign up

Export Citation Format

Share Document