AAAAAA

   
Results: 1-7 |
Results: 7
MINIMIZING MAKESPAN IN A CLASS OF REENTRANT SHOPS
Authors: WANG MY SETHI SP VANDEVELDE SL
Citation: My. Wang et al., MINIMIZING MAKESPAN IN A CLASS OF REENTRANT SHOPS, Operations research, 45(5), 1997, pp. 702-712
SINGLE-MACHINE SCHEDULING WITH RELEASE DATES, DUE-DATES AND FAMILY SETUP TIMES
Authors: SCHUTTEN JMJ VANDEVELDE SL ZIJM WHM
Citation: Jmj. Schutten et al., SINGLE-MACHINE SCHEDULING WITH RELEASE DATES, DUE-DATES AND FAMILY SETUP TIMES, Management science, 42(8), 1996, pp. 1165-1174
MINIMIZING TOTAL COMPLETION-TIME AND MAXIMUM COST SIMULTANEOUSLY IS SOLVABLE IN POLYNOMIAL-TIME
Authors: HOOGEVEEN JA VANDEVELDE SL
Citation: Ja. Hoogeveen et Sl. Vandevelde, MINIMIZING TOTAL COMPLETION-TIME AND MAXIMUM COST SIMULTANEOUSLY IS SOLVABLE IN POLYNOMIAL-TIME, Operations research letters, 17(5), 1995, pp. 205-208
STRONGER LAGRANGIAN BOUNDS BY USE OF SLACK VARIABLES - APPLICATIONS TO MACHINE SCHEDULING PROBLEMS
Authors: HOOGEVEEN JA VANDEVELDE SL
Citation: Ja. Hoogeveen et Sl. Vandevelde, STRONGER LAGRANGIAN BOUNDS BY USE OF SLACK VARIABLES - APPLICATIONS TO MACHINE SCHEDULING PROBLEMS, Mathematical programming, 70(2), 1995, pp. 173-190
DUAL DECOMPOSITION OF A SINGLE-MACHINE SCHEDULING PROBLEM
Authors: VANDEVELDE SL
Citation: Sl. Vandevelde, DUAL DECOMPOSITION OF A SINGLE-MACHINE SCHEDULING PROBLEM, Mathematical programming, 69(3), 1995, pp. 413-428
COMPLEXITY OF SCHEDULING MULTIPROCESSOR TASKS WITH PRESPECIFIED PROCESSOR ALLOCATIONS
Authors: HOOGEVEEN JA VANDEVELDE SL VELTMAN B
Citation: Ja. Hoogeveen et al., COMPLEXITY OF SCHEDULING MULTIPROCESSOR TASKS WITH PRESPECIFIED PROCESSOR ALLOCATIONS, Discrete applied mathematics, 55(3), 1994, pp. 259-272
NEW LOWER AND UPPER-BOUNDS FOR SCHEDULING AROUND A SMALL COMMON DUE-DATE
Authors: HOOGEVEEN JA OOSTERHOUT H VANDEVELDE SL
Citation: Ja. Hoogeveen et al., NEW LOWER AND UPPER-BOUNDS FOR SCHEDULING AROUND A SMALL COMMON DUE-DATE, Operations research, 42(1), 1994, pp. 102-110
Risultati: 1-7 |