Werner Frank

Frank Werner

Information about the author Frank Werner will soon be added to the site.
Found 36 papers in total
Block models for scheduling jobs on two parallel machines with a single server
Block models for scheduling jobs on two parallel machines with a single server
2014
We consider the problem of scheduling a set of non‐preemptable jobs on two...
Measures of problem uncertainty for scheduling with interval processing times
Measures of problem uncertainty for scheduling with interval processing times
2013
The paper deals with scheduling under uncertainty of the job processing times. The...
Erratum to: Minimizing total tardiness on parallel machines with preemptions
Erratum to: Minimizing total tardiness on parallel machines with preemptions
2013
In this note, we correct a mistake which was made in the paper ‘Minimizing Total...
Single machine total tardiness maximization problems: complexity and algorithms
Single machine total tardiness maximization problems: complexity and algorithms
2013
In this paper, we consider some scheduling problems on a single machine, where...
On the application of insertion techniques for job shop problems with setup times
On the application of insertion techniques for job shop problems with setup times
1999
Constructive heuristics for shop scheduling problems are often based on priority (or...
Soft due window assignment and scheduling of unit‐time jobs on parallel machines
Soft due window assignment and scheduling of unit‐time jobs on parallel machines
2012
We study problems of scheduling n unit‐time jobs on m identical parallel...
Minimizing total tardiness on parallel machines with preemptions
Minimizing total tardiness on parallel machines with preemptions
2012
The basic scheduling problem we are dealing with in this paper is the following one. A...
Parallel machine problems with equal processing times: a survey
Parallel machine problems with equal processing times: a survey
2011
The basic scheduling problem we are dealing with is the following. There are n jobs,...
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
2008
In this paper, metaheuristic approaches for the two-machine flow-shop problem with a...
Problem F2‖Cmax with forbidden jobs in the first or last position is easy
Problem F2‖Cmax with forbidden jobs in the first or last position is easy
2007
Saadani et al. studied the classical n -job flow shop scheduling problem F2‖C...
A note on the two machine job shop with the weighted late work criterion
A note on the two machine job shop with the weighted late work criterion
2007
The paper presents a dynamic programming approach for the two-machine nonpreemptive...
Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables
Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables
2007
The problem of scheduling the production of new and recovering defective items of the...
Batching work and rework processes with limited deterioration of reworkables
Batching work and rework processes with limited deterioration of reworkables
2006
We study a deterministic problem of planning the production of new and recovering...
Positive half-products and scheduling with controllable processing times
Positive half-products and scheduling with controllable processing times
2005
We study the single machine scheduling problem with controllable job processing times...
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion
2005
In this paper we analyze different solution procedures for the two-machine flow shop...
Hamiltonian cycles in graphs of triangular grid
Hamiltonian cycles in graphs of triangular grid
2005
A triangular grid graph is a finite induced subgraph of the infinite graph associated...
Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
2001
This paper is devoted to the following version of the single machine preemptive...
Mean flow time minimization with given bounds of processing times
Mean flow time minimization with given bounds of processing times
2004
We consider a job shop scheduling problem under uncertain processing times and fixed...
Two-machine flow shop scheduling with nonregular criteria
Two-machine flow shop scheduling with nonregular criteria
2004
We consider a two-machine flow shop problem with a common due date where the objective...
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
2004
In this paper, the complexity and some other properties of several multi-stage...
Two-machine open shop scheduling with secondary criteria
Two-machine open shop scheduling with secondary criteria
2003
This paper considers two-machine open shop problems with secondary criteria where the...
Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness
Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness
2002
The problem of scheduling n nonpreemptive jobs having a common due date d on m , m...
Complexity results for parallel machine problems with a single server
Complexity results for parallel machine problems with a single server
2002
Parallel machine problems with a single server are generalizations of classical...
Heuristics for hybrid flow shops with controllable processing times and assignable due dates
Heuristics for hybrid flow shops with controllable processing times and assignable due dates
2002
This paper considers a generalization of the permutation flow shop problem that...
Papers per page: