AAAAAA

   
Results: 1-14 |
Results: 14
BATCH SCHEDULING WITH DEADLINES ON PARALLEL MACHINES
Authors: BRUCKER P KOVALYOV MY SHAFRANSKY YM WERNER F
Citation: P. Brucker et al., BATCH SCHEDULING WITH DEADLINES ON PARALLEL MACHINES, Annals of operation research, 83, 1998, pp. 23-40
A BRANCH-AND-BOUND ALGORITHM FOR THE OPEN-SHOP PROBLEM
Authors: BRUCKER P HURINK J JURISCH B WOSTMANN B
Citation: P. Brucker et al., A BRANCH-AND-BOUND ALGORITHM FOR THE OPEN-SHOP PROBLEM, Discrete applied mathematics, 76(1-3), 1997, pp. 43-59
IMPROVING LOCAL SEARCH HEURISTICS FOR SOME SCHEDULING PROBLEMS .2.
Authors: BRUCKER P HURINK J WERNER F
Citation: P. Brucker et al., IMPROVING LOCAL SEARCH HEURISTICS FOR SOME SCHEDULING PROBLEMS .2., Discrete applied mathematics, 72(1-2), 1997, pp. 47-69
IMPROVING LOCAL SEARCH HEURISTICS FOR SOME SCHEDULING PROBLEMS .1.
Authors: BRUCKER P HURINK J WERNER F
Citation: P. Brucker et al., IMPROVING LOCAL SEARCH HEURISTICS FOR SOME SCHEDULING PROBLEMS .1., Discrete applied mathematics, 65(1-3), 1996, pp. 97-122
POLYNOMIAL ALGORITHMS FOR RESOURCE-CONSTRAINED AND MULTIPROCESSOR TASK-SCHEDULING PROBLEMS
Authors: BRUCKER P KRAMER A
Citation: P. Brucker et A. Kramer, POLYNOMIAL ALGORITHMS FOR RESOURCE-CONSTRAINED AND MULTIPROCESSOR TASK-SCHEDULING PROBLEMS, European journal of operational research, 90(2), 1996, pp. 214-226
EFFICIENT ALGORITHMS FOR SOME PATH PARTITIONING PROBLEMS
Authors: BRUCKER P
Citation: P. Brucker, EFFICIENT ALGORITHMS FOR SOME PATH PARTITIONING PROBLEMS, Discrete applied mathematics, 62(1-3), 1995, pp. 77-85
WORKSHOP ON DISCRETE ALGORITHMS, UNIVERSITY-OF-OSNABRUCK, JULY 10-12,1991 - ACKNOWLEDGMENT
Authors: BRUCKER P
Citation: P. Brucker, WORKSHOP ON DISCRETE ALGORITHMS, UNIVERSITY-OF-OSNABRUCK, JULY 10-12,1991 - ACKNOWLEDGMENT, Discrete applied mathematics, 58(2), 1995, pp. 95-95
A MONGE PROPERTY FOR THE D-DIMENSIONAL TRANSPORTATION PROBLEM
Authors: BEIN WW BRUCKER P PARK JK PATHAK PK
Citation: Ww. Bein et al., A MONGE PROPERTY FOR THE D-DIMENSIONAL TRANSPORTATION PROBLEM, Discrete applied mathematics, 58(2), 1995, pp. 97-109
USING TELEMEDICINE FOR CONTINUING-EDUCATION FOR RURAL PHYSICIANS
Authors: SANDERS J BRUCKER P MILLER MD
Citation: J. Sanders et al., USING TELEMEDICINE FOR CONTINUING-EDUCATION FOR RURAL PHYSICIANS, Academic medicine, 70(5), 1995, pp. 457-457
A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM
Authors: BRUCKER P JURISCH B SIEVERS B
Citation: P. Brucker et al., A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM, Discrete applied mathematics, 49(1-3), 1994, pp. 107-127
THE K-TRACK ASSIGNMENT PROBLEM
Authors: BRUCKER P NORDMANN L
Citation: P. Brucker et L. Nordmann, THE K-TRACK ASSIGNMENT PROBLEM, Computing, 52(2), 1994, pp. 97-122
THE COMPLEXITY OF ONE-MACHINE BATCHING PROBLEMS
Authors: ALBERS S BRUCKER P
Citation: S. Albers et P. Brucker, THE COMPLEXITY OF ONE-MACHINE BATCHING PROBLEMS, Discrete applied mathematics, 47(2), 1993, pp. 87-107
SCHEDULING UNIT TIME OPEN SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS
Authors: BRUCKER P JURISCH B TAUTENHAHN T WERNER F
Citation: P. Brucker et al., SCHEDULING UNIT TIME OPEN SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS, Operations research letters, 14(5), 1993, pp. 245-250
SERIES-PARALLEL COMPOSITION OF GREEDY LINEAR-PROGRAMMING PROBLEMS
Authors: BEIN WW BRUCKER P HOFFMAN AJ
Citation: Ww. Bein et al., SERIES-PARALLEL COMPOSITION OF GREEDY LINEAR-PROGRAMMING PROBLEMS, Mathematical programming, 62(1), 1993, pp. 1-14
Risultati: 1-14 |