Advanced search

Authors whose works are in public domain in at least one jurisdiction

List of works by Frank Werner

1-50 of 141 results

View this query on the Wikidata Query Service
Complexity of shop-scheduling problems with fixed number of jobs: a survey

article published in 2007
The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times

Parallel machine scheduling problems with a single server

A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size

scholarly article by D. Danneberg et al published May 1999 in Mathematical and Computer Modelling
Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria

scholarly article by Jitti Jungwattanakit et al published 2 March 2007 in The International Journal of Advanced Manufacturing Technology
Block models for scheduling jobs on two parallel machines with a single server

Batching work and rework processes with limited deterioration of reworkables

On the application of insertion techniques for job shop problems with setup times

Improving local search heuristics for some scheduling problems—I

Heuristics for permutation flow shop scheduling with batch setup times

Insertion techniques for the heuristic solution of the job shop problem

Scheduling with multiple servers

article
Stability of a schedule minimizing mean flow time

article
Optimal schedules with infinitely large stability radius∗

Scheduling Problems and Mixed Graph Colorings

scholarly article by Yuri N. Sotskov et al published May 2002 in Optimization
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties

Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop

scholarly article by Michael Andresen et al published October 2008 in Mathematical and Computer Modelling
Improving local search heuristics for some scheduling problems. Part II

Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties

scholarly article by J. Bank & Frank Werner published February 2001 in Mathematical and Computer Modelling
Simulated annealing and genetic algorithms for the two-machine scheduling problem with a single server

scholarly article by Keramat Hasani et al published 10 January 2014 in International Journal of Production Research
On the heuristic solution of the permutation flow shop problem by path algorithms

scholarly article by Frank Werner published September 1993 in Computers and Operations Research
Parallel machine problems with equal processing times: a survey

Mean flow time minimization with given bounds of processing times

The two-machine flow-shop problem with weighted late work criterion and common due date

article by Jacek Błażewicz et al published September 2005 in European Journal of Operational Research
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date

article by Jacek Błażewicz et al published February 2008 in Computers and Operations Research
Minimizing total flow time in a two-machine flowshop problem with minimum makespan

Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time

A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria

scholarly article by Jitti Jungwattanakit et al published February 2009 in Computers and Operations Research
Algorithms for some maximization scheduling problems on a single machine

scholarly article by E. R. Gafarov et al published October 2010 in Automation and Remote Control
Stability of an optimal schedule in a job shop

On a parallel machine scheduling problem with equal processing times

Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one

Optimal makespan scheduling with given bounds of processing times

Adaptive scheduling algorithm based on mixed graph model

article
Stability Radius of an Optimal Schedule: A Survey and Recent Developments

article
A note on the two machine job shop with the weighted late work criterion

Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey

article by V. Lauff & Frank Werner published September 2004 in Mathematical and Computer Modelling
Open shop scheduling problems with late work criteria

A graphical realization of the dynamic programming method for solving N P -hard combinatorial problems

article
Heuristics for hybrid flow shops with controllable processing times and assignable due dates

article published in 2002
Filling of Irregular Channels with Round Cross-Section: Modeling Aspects to Study the Properties of Porous Materials

Constructive heuristic algorithms for the open shop problem

scholarly article by H. Bräsel et al published June 1993 in Computing
Erratum to: Minimizing total tardiness on parallel machines with preemptions

scholarly article published in Journal of Scheduling
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion

article published in 2005
Q57633976

article published in 1998
Preemptive scheduling on uniform machines to minimize mean flow time

article
Heuristics for generalized shop scheduling problems based on decomposition

article
Algorithms for special cases of the single machine total tardiness problem and an application to the even–odd partition problem

scholarly article by Alexander A. Lazarev & Frank Werner published May 2009 in Mathematical and Computer Modelling
Q57633944

article published in 2002
Minimizing total tardiness on parallel machines with preemptions

Paulina is supported by:

About Paulina

Help