AAAAAA

   
Results: 1-11 |
Results: 11
A LOCAL SEARCH TEMPLATE
Authors: VAESSENS RJM AARTS EHL LENSTRA JK
Citation: Rjm. Vaessens et al., A LOCAL SEARCH TEMPLATE, Computers & operations research, 25(11), 1998, pp. 969-979
NETWORKS AND MATROIDS - SEQUENCING AND SCHEDULING - PREFACE
Authors: LENSTRA JK SHMOYS D
Citation: Jk. Lenstra et D. Shmoys, NETWORKS AND MATROIDS - SEQUENCING AND SCHEDULING - PREFACE, Mathematical programming, 82(1-2), 1998, pp. 1-1
SHORT SHOP SCHEDULES
Authors: WILLIAMSON DP HALL LA HOOGEVEEN JA HURKENS CAJ LENSTRA JK SEVASTJANOV SV SHMOYS DB
Citation: Dp. Williamson et al., SHORT SHOP SCHEDULES, Operations research, 45(2), 1997, pp. 288-294
PREEMPTIVE SCHEDULING IN A 2-STAGE MULTIPROCESSOR FLOW-SHOP IS NP-HARD
Authors: HOOGEVEEN JA LENSTRA JK VELTMAN B
Citation: Ja. Hoogeveen et al., PREEMPTIVE SCHEDULING IN A 2-STAGE MULTIPROCESSOR FLOW-SHOP IS NP-HARD, European journal of operational research, 89(1), 1996, pp. 172-175
THE COMPLEXITY OF SCHEDULING TREES WITH COMMUNICATION DELAYS
Authors: LENSTRA JK VELDHORST M VELTMAN B
Citation: Jk. Lenstra et al., THE COMPLEXITY OF SCHEDULING TREES WITH COMMUNICATION DELAYS, Journal of algorithms, 20(1), 1996, pp. 157-173
THE ONE-MACHINE PROBLEM WITH DELAYED PRECEDENCE CONSTRAINTS AND ITS USE IN JOB-SHOP SCHEDULING
Authors: BALAS E LENSTRA JK VAZACOPOULOS A
Citation: E. Balas et al., THE ONE-MACHINE PROBLEM WITH DELAYED PRECEDENCE CONSTRAINTS AND ITS USE IN JOB-SHOP SCHEDULING, Management science, 41(1), 1995, pp. 94-109
PERIODIC ASSIGNMENT AND GRAPH-COLORING
Authors: KORST J AARTS E LENSTRA JK WESSELS J
Citation: J. Korst et al., PERIODIC ASSIGNMENT AND GRAPH-COLORING, Discrete applied mathematics, 51(3), 1994, pp. 291-305
A COMPARATIVE-STUDY IN DSS DEVELOPMENT
Authors: VANHEE KM LENSTRA JK
Citation: Km. Vanhee et Jk. Lenstra, A COMPARATIVE-STUDY IN DSS DEVELOPMENT, European journal of operational research, 79(2), 1994, pp. 153-157
3, 4, 5, 6, OR THE COMPLEXITY OF SCHEDULING WITH COMMUNICATION DELAYS
Authors: HOOGEVEEN JA LENSTRA JK VELTMAN B
Citation: Ja. Hoogeveen et al., 3, 4, 5, 6, OR THE COMPLEXITY OF SCHEDULING WITH COMMUNICATION DELAYS, Operations research letters, 16(3), 1994, pp. 129-137
SEQUENTIAL AND PARALLEL LOCAL SEARCH FOR THE TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM
Authors: KINDERVATER G LENSTRA JK SAVELSBERGH M
Citation: G. Kindervater et al., SEQUENTIAL AND PARALLEL LOCAL SEARCH FOR THE TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM, Discrete applied mathematics, 42(2-3), 1993, pp. 211-225
VARIABLE-DEPTH SEARCH FOR THE SINGLE-VEHICLE PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS
Authors: VANDERBRUGGEN LJJ LENSTRA JK SCHUUR PC
Citation: Ljj. Vanderbruggen et al., VARIABLE-DEPTH SEARCH FOR THE SINGLE-VEHICLE PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS, Transportation science, 27(3), 1993, pp. 298-311
Risultati: 1-11 |