Frank Werner

From MaRDI portal
Revision as of 21:24, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Frank Werner to Frank Werner: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:229433

Available identifiers

zbMath Open werner.frankDBLP52/2807WikidataQ57415772 ScholiaQ57415772MaRDI QIDQ229433

List of research outcomes





PublicationDate of PublicationType
Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations2024-07-08Paper
Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems2024-04-03Paper
A multi-objective sustainable planning for a real hazardous waste production problem2022-07-03Paper
Home health care planning with considering flexible starting/ending points and service features2022-05-02Paper
A metric approach for scheduling problems with minimizing the maximum penalty2021-11-15Paper
Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine2021-01-14Paper
Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines2020-01-27Paper
Minimizing the makespan on two identical parallel machines with mold constraints2019-02-19Paper
A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization2018-10-09Paper
Approaches to modeling train scheduling problems as job-shop problems with blocking constraints2018-04-13Paper
Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan2017-06-29Paper
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 graphs2017-01-23Paper
A new effective dynamic program for an investment optimization problem2017-01-20Paper
Graphs with maximal induced matchings of the same size2016-11-24Paper
Block models for scheduling jobs on two parallel machines with a single server2016-11-10Paper
https://portal.mardi4nfdi.de/entity/Q28097652016-05-30Paper
A graphical approach to solve an investment optimization problem2014-12-16Paper
Approximability results for the resource-constrained project scheduling problem with a single type of resources2014-09-26Paper
Erratum to: ``Minimizing total tardiness on parallel machines with preemptions2014-08-18Paper
Minimizing total weighted completion time approximately for the parallel machine problem with a single server2014-05-05Paper
Parallel machine problems with equal processing times: a survey2014-02-05Paper
Minimizing total tardiness on parallel machines with preemptions2014-02-05Paper
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time2014-01-10Paper
Single machine total tardiness maximization problems: complexity and algorithms2013-09-16Paper
Measures of problem uncertainty for scheduling with interval processing times2013-08-07Paper
https://portal.mardi4nfdi.de/entity/Q28373762013-07-10Paper
A note on the paper `Single machine scheduling problems with financial resource constraints: some complexity results and properties' by E.R. Gafarov et al.2013-05-10Paper
Soft due window assignment and scheduling of unit-time jobs on parallel machines2013-02-18Paper
Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one2012-11-15Paper
https://portal.mardi4nfdi.de/entity/Q29130972012-09-26Paper
A note on a single machine scheduling problem with generalized total tardiness objective function2012-03-09Paper
The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times2012-01-18Paper
The complexity of dissociation set problems in graphs2011-08-10Paper
Single machine scheduling problems with financial resource constraints: some complexity results and properties2011-08-04Paper
Foreword to the thematical issue devoted to the seventieth anniversary of Academician V. S. Tanaev2011-01-03Paper
Minimizing total weighted completion time with uncertain data: a stability approach2011-01-03Paper
Algorithms for some maximization scheduling problems on a single machine2011-01-03Paper
Scheduling with multiple servers2011-01-03Paper
A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems2010-06-28Paper
Parallel machine scheduling problems with a single server2010-05-06Paper
Minimizing the number of machines for scheduling jobs with equal processing times2009-12-07Paper
Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem2009-10-12Paper
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop2009-07-19Paper
On a parallel machine scheduling problem with equal processing times2009-06-30Paper
Preemptive scheduling on uniform machines to minimize mean flow time2009-05-19Paper
https://portal.mardi4nfdi.de/entity/Q36211302009-04-14Paper
https://portal.mardi4nfdi.de/entity/Q36175532009-03-29Paper
https://portal.mardi4nfdi.de/entity/Q35988782009-02-03Paper
Hamiltonian properties of triangular grid graphs2009-01-28Paper
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria2008-11-07Paper
Heuristic constructive algorithms for open shop scheduling to minimize mean flow time2008-04-24Paper
Complexity of shop-scheduling problems with fixed number of jobs: a survey2007-11-14Paper
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date2007-10-10Paper
A note on the two machine job shop with the weighted late work criterion2007-05-15Paper
Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy2006-12-07Paper
KI 2005: Advances in Artificial Intelligence2006-11-13Paper
Batching work and rework processes with limited deterioration of reworkables2006-01-10Paper
The two-machine flow-shop problem with weighted late work criterion and common due date2005-04-21Paper
Positive half-products and scheduling with controllable processing times2005-04-21Paper
https://portal.mardi4nfdi.de/entity/Q46674152005-04-19Paper
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties2005-02-23Paper
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey2005-02-22Paper
Two-machine flow shop scheduling with nonregular criteria2005-01-17Paper
Mean flow time minimization with given bounds of processing times2004-11-22Paper
Two-machine open shop scheduling with secondary criteria2004-08-10Paper
Open shop scheduling problems with late work criteria.2004-01-26Paper
Complexity results for parallel machine problems with a single server2003-02-23Paper
Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness2002-12-15Paper
Scheduling Problems and Mixed Graph Colorings2002-11-28Paper
A heuristic algorithm for minimizing mean flow time with unit setups2002-07-14Paper
Heuristics for hybrid flow shops with controllable processing times and assignable due dates2002-07-11Paper
Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals2002-06-16Paper
A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size2002-05-05Paper
https://portal.mardi4nfdi.de/entity/Q27841752002-04-17Paper
Local search heuristics for two-stage flow shop problems with secondary criterion2002-02-13Paper
Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties2001-07-08Paper
https://portal.mardi4nfdi.de/entity/Q27123662001-07-02Paper
https://portal.mardi4nfdi.de/entity/Q27123602001-05-06Paper
https://portal.mardi4nfdi.de/entity/Q27123652001-05-06Paper
On the application of insertion techniques for job shop problems with setup times2000-08-24Paper
https://portal.mardi4nfdi.de/entity/Q42470592000-05-25Paper
Complexity of mixed shop scheduling problems: A survey2000-03-19Paper
Shop-scheduling problems with fixed and non-fixed machine orders of the jobs2000-01-11Paper
Heuristics for generalized shop scheduling problems based on decomposition1999-09-09Paper
Batch scheduling with deadlines on parallel machines1999-03-07Paper
On the calculation of the stability radius of an optimal or an approximate schedule1998-12-06Paper
Optimal makespan scheduling with given bounds of processing times1998-09-07Paper
A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\)1998-07-06Paper
Single machine scheduling with deadlines, release and due dates1998-02-05Paper
On the solution of determinantal systems of linear inequalities1997-08-27Paper
Stability of a schedule minimizing mean flow time1997-08-03Paper
Improving local search heuristics for some scheduling problems. II1997-04-21Paper
Adaptive scheduling algorithm based on mixed graph model1996-11-25Paper
Heuristics for permutation flow shop scheduling with batch setup times1996-10-31Paper
single Machine Preemptive Scheduling With Special Cost Functions11996-10-30Paper
Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times1996-07-24Paper
Improving local search heuristics for some scheduling problems. I1996-07-07Paper
A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs1996-04-29Paper
A strongly polynomial algorithm for a new class of linear inequalities11995-06-21Paper
Optimal schedules with infinitely large stability radius1995-06-21Paper
A polynomial algorithm for an open shop problem with unit processing times and tree constraints1995-05-17Paper
Insertion techniques for the heuristic solution of the job shop problem1995-05-17Paper
A branch and bound algorithm for minimizing weighted completion times with deadlines1995-04-20Paper
Constructive heuristic algorithms for the open shop problem1994-09-26Paper
On the heuristic solution of the permutation flow shop problem by path algorithms1994-08-18Paper
https://portal.mardi4nfdi.de/entity/Q42930211994-05-18Paper
A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}\) open shop problem]1994-04-12Paper
Scheduling unit time open shops to minimize the weighted number of late jobs1994-04-06Paper
On the combinatorial structure of the permutation flow shop problem1992-06-25Paper
Some relations between neighbourhood graphs for a permutation problem1992-06-25Paper
A locally optimal insertion heuristic for a one-machine scheduling problem1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34846161990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34961401989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37785311988-01-01Paper
Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37638831987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37800271987-01-01Paper
On the method of interchanging networks for permutation problems1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37472171986-01-01Paper

Research outcomes over time

This page was built for person: Frank Werner