نتایج جستجو برای: machine reliability branch and bound
تعداد نتایج: 16899046 فیلتر نتایج به سال:
This paper studies the solving of finite-domain action planning problems with discrete action costs and soft constraints. For sequential optimal planning, a symbolic perimeter database heuristic is addressed in a bucket implementation of A*. For computing net-benefits, we propose symbolic branch-and-bound search together with some search refinements. The net-benefit we optimize is the total ben...
jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables. in this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using the ranking function and also the branch and bound method along with an example is presented.
We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for th...
We present a branch and bound algorithm for the single machine scheduling problem where the objective function is to minimize the number of late jobs. Lower bounds based on Lagrangean relaxation and on relaxations of the problem to polynomialy solvable cases are proposed. Efficient elimination rules together with strong dominance properties are also used to reduce the search space. A branch and...
In this study, we consider a permutation flow shop scheduling problem on a three-machine with deteriorating jobs (a deteriorating job means that the job’s processing time is an increasing function of its starting time) so as to minimize the makespan. We model job deterioration as a function that is proportional to a linear function of time. For some special cases, we prove that the problem can ...
this study focuses on tracing the clearly defined elements of magic realism in toni morrison’s song of solomon as an illustrious african american example of the mode. magic realism is a fictional technique that combines fantasy with raw physical reality in a search for truth beyond that available from the surface of everyday life. toni morrison, as a distinguished african-american practitioner ...
A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates
The Multi-Processor Job Shop and Flow Shop scheduling problems are variants on the standard Job Shop and Flow Shop problems in which each machine has the capacity to process more than one job simultaneously. This class of problems has attracted the attention of researchers in recent years and several lower bounds has been proposed for a Branch-and-Bound solution method. But only a few attempts ...
earth pressure balance tunnel boring machines (epb-tbms) are favorably applied in urban tunneling projects. despite their numerous advantages, considerable delays and high maintenance cost are the main disadvantages these machines suffer from. reliability, availability, and maintainability (ram) analysis is a practical technique that uses failure and repair dataset obtained over a reasonable ti...
We present a suite of tools for visualizing the status and progress of branch-and-bound algorithms for mixed integer programming. By integrating these tools with the open-source codes CBC, SYMPHONY, and GLPK, we demonstrate the potential usefulness of visual representations in helping a user predict future progress of the algorithm or analyzing the algorithm’s performance. We have also implemen...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید