Bart Veltman

According to our database, Bart Veltman authored at least 8 papers between 1990 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

Shift rostering using decomposition: assign weekend shifts first.

Egbert van der Veen, Erwin W. Hans, Gerhard F. Post, Bart Veltman

J. Sched., 2015

2008

A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem.

Edmund K. Burke, Timothy Curtois, Gerhard F. Post, Rong Qu, Bart Veltman

Eur. J. Oper. Res., 2008

1996

The Complexity of Scheduling Trees with Communication Delays.

Jan Karel Lenstra, Marinus Veldhorst, Bart Veltman

J. Algorithms, 1996

1994

Three, four, five, six, or the complexity of scheduling with communication delays.

J. A. Hoogeveen, Jan Karel Lenstra, Bart Veltman

Oper. Res. Lett., 1994

Sequencing and Cooperation.

Imma J. Curiel, Jos A. M. Potters, Rajendra Prasad, Stef Tijs, Bart Veltman

Oper. Res., 1994

Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations.

J. A. Hoogeveen, Steef L. van de Velde, Bart Veltman

Discret. Appl. Math., 1994

1993

Cooperation in one machine scheduling.

Imma J. Curiel, Jos A. M. Potters, Rajendra Prasad, Stef Tijs, Bart Veltman

ZOR Methods Model. Oper. Res., 1993

1990

Multiprocessor scheduling with communication delays.

Bart Veltman, B. J. Lageweg, Jan Karel Lenstra

Parallel Comput., 1990