Showing 849,031 - 849,040 of 859,838
Most scheduling problems are notoriously intractable, so the majority of algorithms for them are heuristic in nature. Priority rule-based methods still constitute the most important class of these heuristics. Of these, in turn, parameterized biased random sampling methods have attracted...
Persistent link: https://www.econbiz.de/10011558731
We consider the problem of scheduling multiple, large-scale, make-to-order assemblies under resource, assembly area, and part availability constraints. Such problems typically occur in the assembly of high volume, discrete make-to-order products. Based on a list scheduling procedure which has...
Persistent link: https://www.econbiz.de/10011558732
In this paper we present a polynomial time dynamic programming algorithm for solving a scheduling problem with a (total) weighted completion time objective function where the weights are activity- and time-dependent. We highlight application areas for this type of problem to underscore the...
Persistent link: https://www.econbiz.de/10011558733
Persistent link: https://www.econbiz.de/10011558734
Persistent link: https://www.econbiz.de/10011558735
This contribution presents an efficient solution method for solving the major short-term planning problems which occur, if lot production has to be managed. In our focus are the two most important aspects, i.e. lot sizing and scheduling. Since both problems heavily interact, we propose an...
Persistent link: https://www.econbiz.de/10011558736
The resource investment problem deals with the issue of providing resources to a project such that a given deadline can be met. The objective is to make the resources available in the cheapest possible way. For each resource, expenses depend on the maximum amount required during the course of...
Persistent link: https://www.econbiz.de/10011558737
For most computationally intractable problems there exists no heuristic which performs best on all instances. Usually, a heuristic characterized as best will perform good on the majority of instances but leave a minority on which other heuristics do better. In priority rule-based scheduling,...
Persistent link: https://www.econbiz.de/10011558738
Over the years numerous branch-and-bound procedures for solving the resource-constrained project scheduling problem (RCPSP) have been developed. Enumerating delaying alternatives, extension alternatives, feasible posets, feasible sequences, feasible completion times or feasible subsets, they all...
Persistent link: https://www.econbiz.de/10011558739
Persistent link: https://www.econbiz.de/10011558741