Person:1268849

Available identifiers

zbMath Open van-de-velde.steef-lMaRDI QIDQ1268849

List of research outcomes

Publication	Date of Publication	Type
Formulating a scheduling problem with almost identical jobs by using positional completion times	2022-08-30	Paper
Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop	2021-08-09	Paper
Are stacker crane problems easy? A statistical study	2016-11-14	Paper
Tactical fixed job scheduling with spread-time constraints	2016-11-10	Paper
Two-machine interval shop scheduling with time lags	2015-11-12	Paper
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem	2012-05-30	Paper
Approximation algorithms for the parallel flow shop problem	2012-05-14	Paper
On-line two-machine job shop scheduling with time lags	2012-03-12	Paper
Polynomial-time approximation schemes for scheduling problems with time lags	2010-11-03	Paper
On-line two-machine open shop scheduling with time lags	2010-01-15	Paper
Roll cutting in the curtain industry, or: a well-solvable allocation problem	2007-08-27	Paper
Lower bounds for minimizing total completion time in a two-machine flow shop	2007-05-15	Paper
Applying Column Generation to Machine Scheduling	2006-10-16	Paper
Algorithms – ESA 2005	2006-06-27	Paper
Multi-product lot-sizing with a transportation capacity reservation contract	2005-05-12	Paper
Parallel Machine Scheduling by Column Generation	2002-02-07	Paper
Scheduling with target start times	2001-03-12	Paper
Positioning automated guided vehicles in a loop layout	2001-02-22	Paper
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine	1999-10-18	Paper
Minimizing makespan in a pallet-constrained flowshop	1999-10-05	Paper
Scheduling deteriorating jobs to minimize makespan	1999-06-10	Paper
https://portal.mardi4nfdi.de/entity/Q4234143	1999-03-16	Paper
Scheduling a batching machine	1999-01-11	Paper
Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity	1998-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q4398369	1998-07-19	Paper
Minimizing Makespan in a Class of Reentrant Shops	1998-06-08	Paper
A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time	1998-04-05	Paper
https://portal.mardi4nfdi.de/entity/Q4343706	1998-02-05	Paper
Earliness-Tardiness Scheduling Around Almost Equal Due Dates	1998-01-15	Paper
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time	1997-03-23	Paper
Dual decomposition of a single-machine scheduling problem	1996-02-12	Paper
Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems	1996-02-06	Paper
Complexity of scheduling multiprocessor tasks with prespecified processors allocations	1995-02-01	Paper
New Lower and Upper Bounds for Scheduling Around a Small Common Due Date	1994-11-06	Paper
Duality-Based Algorithms for Scheduling Unrelated Parallel Machines	1993-12-09	Paper
A new lower bound approach for single-machine multicriteria scheduling	1993-01-16	Paper
Scheduling around a small common due date	1992-06-28	Paper
A simpler and faster algorithm for optimal total-work-content-power due data determination	1990-01-01	Paper
Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation	1990-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Steef L. van de Velde