| Publication | Date of Publication | Type |
|---|
An advanced tabu search algorithm for the job shop problem
Journal of Scheduling | 2007-12-20 | Paper |
Computational Science - ICCS 2004
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Some aspects of scatter search in the flow-shop problem
European Journal of Operational Research | 2005-10-26 | Paper |
| scientific article; zbMATH DE number 2209652 (Why is no real title available?) | 2005-09-28 | Paper |
| scientific article; zbMATH DE number 1998825 (Why is no real title available?) | 2003-11-02 | Paper |
The permutation flow shop with buffers: A tabu search approach
European Journal of Operational Research | 2002-08-18 | Paper |
The flow shop with parallel machines: A tabu search approach
European Journal of Operational Research | 2002-08-18 | Paper |
| scientific article; zbMATH DE number 1488079 (Why is no real title available?) | 2001-10-21 | Paper |
An approximation algorithm for a single-machine scheduling problem with release times and delivery times
Discrete Applied Mathematics | 2000-08-14 | Paper |
A fast tabu search algorithm for the permutation flow-shop problem
European Journal of Operational Research | 1999-02-22 | Paper |
A Fast Taboo Search Algorithm for the Job Shop Problem
Management Science | 1997-11-12 | Paper |
Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach
The Journal of the Operational Research Society | 1996-12-01 | Paper |
New results in the worst-case analysis for flow-shop scheduling
Discrete Applied Mathematics | 1996-10-08 | Paper |
A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
Discrete Applied Mathematics | 1996-07-07 | Paper |
A decision support system for the resource constrained project scheduling problem
European Journal of Operational Research | 1995-02-09 | Paper |
A note on worst-case analysis of approximation algorithms for a scheduling problem
European Journal of Operational Research | 1995-01-19 | Paper |
An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
European Journal of Operational Research | 1994-11-17 | Paper |
An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
European Journal of Operational Research | 1993-12-20 | Paper |
| scientific article; zbMATH DE number 175998 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 63662 (Why is no real title available?) | 1992-09-27 | Paper |
Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
Operations Research Letters | 1992-06-28 | Paper |
A survey of results for sequencing problems with controllable processing times
Discrete Applied Mathematics | 1990-01-01 | Paper |
Worst-case analysis of an approximation algorithm for flow-shop scheduling
Operations Research Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4147846 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4147845 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4158358 (Why is no real title available?) | 1989-01-01 | Paper |
A two-machine flow shop scheduling problem with controllable job processing times
European Journal of Operational Research | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4143765 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4099024 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4085399 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4143766 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4085400 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4095193 (Why is no real title available?) | 1987-01-01 | Paper |
On lower bounds on the minimum maximum lateness on one machine subject to release date
Opsearch | 1987-01-01 | Paper |
A note on minimizing maximum lateness in a one-machine sequencing problem with release dates
European Journal of Operational Research | 1986-01-01 | Paper |
A block approach for single-machine scheduling with release dates and due dates
European Journal of Operational Research | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4079152 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4074799 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4074798 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4010197 (Why is no real title available?) | 1985-01-01 | Paper |
Scheduling jobs with controllable processing times as an optimal control problem
International Journal of Control | 1984-01-01 | Paper |
Optimal control policies for resource allocation in an activity network
European Journal of Operational Research | 1984-01-01 | Paper |
Optimal control of a complex of independent operations
International Journal of Systems Science. Principles and Applications of Systems and Integration | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3665703 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3586071 (Why is no real title available?) | 1976-01-01 | Paper |
