Showing 1 - 10 of 23
We computationally assess policies for the elevator control problem by a new column-generation approach for the linear programming method for discounted infinite-horizon Markov decision problems. By analyzing the optimality of given actions in given states, we were able to provably improve the...
Persistent link: https://www.econbiz.de/10011000010
The Minimum Power Multicast Problem arises in wireless sensor networks and consists in assigning a transmission power to each node of a network in such a way that the total power consumption over the network is minimized, while a source node is connected to a set of destination nodes, toward...
Persistent link: https://www.econbiz.de/10010949917
It is not straightforward to find a new feasible solution when several conic constraints are added to a conic optimization problem. Examples of conic constraints include semidefinite constraints and second order cone constraints. In this paper, a method to slightly modify the constraints is...
Persistent link: https://www.econbiz.de/10010949922
Manpower still is one of the most expensive resources, in spite of increasing automation. While employee scheduling and …
Persistent link: https://www.econbiz.de/10010950267
In this paper, a branch and bound approach is proposed for global optimization problem (P) of the sum of generalized polynomial fractional functions under generalized polynomial constraints, which arises in various practical problems. Due to its intrinsic difficulty, less work has been devoted...
Persistent link: https://www.econbiz.de/10010949997
This paper deals with the generalized resource-constrained project scheduling problem (GRCPSP) which extends the well …-known resource-constrained project scheduling problem (RCPSP) by considering job specific release and due dates, non-negative minimum …
Persistent link: https://www.econbiz.de/10010950224
A polynomial algorithm is proposed for two scheduling problems for which the complexity status was open. A set of jobs …
Persistent link: https://www.econbiz.de/10010999571
The coupled task problem is to schedule n jobs on one machine where each job consists of two subtasks with required delay time between them. The objective is to minimize the makespan. This problem was analyzed in depth by Orman and Potts [3]. They investigated the complexity of different cases...
Persistent link: https://www.econbiz.de/10010999593
In this note, we prove ??-completeness of the following problem: Given a set of trams of different types, which are stacked on sidings in their depot and an order in which trams of specified types are supposed to leave. Is there an assignment of trams to departure times without any shunting...
Persistent link: https://www.econbiz.de/10010999609
For more than two machines, and when preemption is forbidden, the computation of minimum makespan schedules for the open-shop problem is NP-hard. Compared to the flow-shop and the job-shop, the open-shop has free job routes which lead to a much larger solution space, to smaller gaps between the...
Persistent link: https://www.econbiz.de/10010999896