Steef L. van de Velde

According to our database1, Steef L. van de Velde authored at least 36 papers between 1990 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop.
4OR, 2021

2016
Increasing the revenue of self-storage warehouses by optimizing order scheduling.
Eur. J. Oper. Res., 2016

2015
Two-machine interval shop scheduling with time lags.
J. Sched., 2015

2014
Tactical fixed job scheduling with spread-time constraints.
Comput. Oper. Res., 2014

2013
Are Stacker Crane Problems easy? A statistical study.
Comput. Oper. Res., 2013

2012
Approximation algorithms for the parallel flow shop problem.
Eur. J. Oper. Res., 2012

2010
Polynomial-time approximation schemes for scheduling problems with time lags.
J. Sched., 2010

On-line two-machine job shop scheduling with time lags.
Inf. Process. Lett., 2010

On-line two-machine open shop scheduling with time lags.
Eur. J. Oper. Res., 2010

2008
Editorial 10th anniversary volume (volume 11).
J. Sched., 2008

2007
Personnel scheduling in a complex logistic system: a railway application case.
J. Intell. Manuf., 2007

Roll cutting in the curtain industry, or: A well-solvable allocation problem.
Eur. J. Oper. Res., 2007

Agent-based Human-computer-interaction for Real-time Monitoring Systems in the Trucking Industry.
Proceedings of the 40th Hawaii International International Conference on Systems Science (HICSS-40 2007), 2007

2006
Lower bounds for minimizing total completion time in a two-machine flow shop.
J. Sched., 2006

2005
Editorial.
J. Sched., 2005

Multi-product lot-sizing with a transportation capacity reservation contract.
Eur. J. Oper. Res., 2005

Roll Cutting in the Curtain Industry.
Proceedings of the Algorithms, 2005

2003
Introduction: Sport and Computers.
Eur. J. Oper. Res., 2003

2002
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem.
INFORMS J. Comput., 2002

Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem.
INFORMS J. Comput., 2002

2001
Scheduling with target start times.
Eur. J. Oper. Res., 2001

2000
Positioning automated guided vehicles in a loop layout.
Eur. J. Oper. Res., 2000

1999
Parallel Machine Scheduling by Column Generation.
Oper. Res., 1999

1998
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine.
Math. Program., 1998

1997
Minimizing Makespan in a Class of Reentrant Shops.
Oper. Res., 1997

Earliness-Tardiness Scheduling Around Almost Equal Due Dates.
INFORMS J. Comput., 1997

1996
A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time.
INFORMS J. Comput., 1996

1995
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time.
Oper. Res. Lett., 1995

Dual decomposition of a single-machine scheduling problem.
Math. Program., 1995

Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994
Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations.
Discret. Appl. Math., 1994

1993
Duality-Based Algorithms for Scheduling Unrelated Parallel Machines.
INFORMS J. Comput., 1993

Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1992
A new lower bound approach for single-machine multicriteria scheduling.
Oper. Res. Lett., 1992

New Lower and Upper Bounds for Scheduling Around a Small Common Due Date.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1990
Dual Decomposition of Single Machine Scheduling Problems.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990


  Loading...