Werner, Frank, 1955-....
Werner, Frank
Werner, Frank (matematyka).
Werner, Frank, econometrie
Frank Werner
VIAF ID: 60288702 ( Personal )
Permalink: http://viaf.org/viaf/60288702
Preferred Forms
- 100 0 _ ‡a Frank Werner
-
-
-
- 100 1 _ ‡a Werner, Frank ‡c econometrie
- 100 1 _ ‡a Werner, Frank ‡d 1955-
-
- 100 1 _ ‡a Werner, Frank, ‡d 1955-
-
-
-
- 100 1 _ ‡a Werner, Frank, ‡d 1955-....
4xx's: Alternate Name Forms (5)
5xx's: Related Names (3)
- 510 2 _ ‡a Magdeburg, Techn. Hochsch
- 510 2 _ ‡a Otto-von-Guericke-Universität Magdeburg ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Universität Magdeburg
Works
Title | Sources |
---|---|
1|/σCi | |
approximation algorithm for problem P,S1|si = 1|/σCi | |
comparative computational study of the effect of the preliminary reduction for the classical and multiprocessor job-shop scheduling problems | |
comparison of heuristic algorithms for flow shop Scheduling problems with setup times and limited batch size | |
dominance digraph as a solution to the two-machine flow shop problem with interval processing times | |
enumerative algorithm for two-machine flow shop problems with earliness and tardiness penalties | |
exact solution procedure for the total product rate variation problem | |
Finding the Pareto set for a bi-criteria scheduling problem on a single machine with equal processing times | |
A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs | |
general approximation approach for multi-machine scheduling problems with minimizing the maximum penalty | |
Genetic algorithms for hybrid job-shop problems with minimizing the makespan and mean flow time | |
Graph-theoretic problems and their new applications | |
graphical approach for solving NP-hard combinatorial problems | |
Hamiltonian properties of triangular grid graphs | |
Heuristic algorithms to maximize the weighted revenue and weighted number of jobs processed on parallel uniform machines | |
hybrid harmony search/simulated annealing algorithm for minimizing mean flow time on two identical parallel machines with a single server | |
Local search heuristics for two-stage flow shop problems with secondary criterion | |
Lot sizing for an imperfect continuous production on two machines | |
Mathematics of economics and business, 2006: | |
A minimal dominant set of critical paths for the project-network with interval activity durations | |
Minimizing a separable convex function on parallel machines with preemptions | |
Minimizing the makespan for the two-machine scheduling problem with a single server two algorithms for very large instances | |
Minimizing the number of machines in a unit time | |
Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine | |
Modeling of spherical particle packing structures using mathematical tessellation | |
Multicriteria optimization : pareto-optimality and threshold-optimality | |
On an equipment heating scheduling problem | |
On preemptive scheduling on uniform machines to minimize mean flow time | |
On systems of vectors and their characteristics | |
On the calculation of the stability radius of an optimal or an approximate schedule | |
On the complexity and some properties of multi stage scheduling problems with earliness and tardiness penalties | |
Open shop scheduling with secondary criteria | |
Performance analysis of material handling tools for a discrete manufacturing system | |
Planning in Time-management as sequencing given jobs with interval prozessing times | |
Sequencing and scheduling with inaccurate data | |
Shop scheduling problems with fixed and non-fixed machine orders of the jobs | |
Single maschine scheduling to minimize the weighted number of late jobs with deadlines and nested release and due date intervals | |
Solution techniques for the blocking job shop scheduling problem with total tardiness minimization | |
Sonderwerbeformen im Fernsehen eine ökonomische und rechtliche Analyse | |
Two-machine job-shop scheduling with one equal-length operation per job on each machine | |
Unit time job shop scheduling via mixed graph coloring | |
Zur Lösung spezieller Reihenfolgeprobleme | |
Zur Struktur und näherungsweisen Lösung ausgewählter kombinatorischer Optimierungsprobleme |