AAAAAA

   
Results: 1-7 |
Results: 7
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
ALGORITHMS FOR MINCLIQUE SCHEDULING PROBLEMS
Authors: JURISCH B KUBIAK W JOZEFOWSKA J
Citation: B. Jurisch et al., ALGORITHMS FOR MINCLIQUE SCHEDULING PROBLEMS, Discrete applied mathematics, 72(1-2), 1997, pp. 115-139
2-MACHINE OPEN SHOPS WITH RENEWABLE RESOURCES
Authors: JURISCH B KUBIAK W
Citation: B. Jurisch et W. Kubiak, 2-MACHINE OPEN SHOPS WITH RENEWABLE RESOURCES, Operations research, 45(4), 1997, pp. 544-552
LOWER BOUNDS FOR THE JOB-SHOP SCHEDULING PROBLEM ON MULTIPURPOSE MACHINES
Authors: JURISCH B
Citation: B. Jurisch, LOWER BOUNDS FOR THE JOB-SHOP SCHEDULING PROBLEM ON MULTIPURPOSE MACHINES, Discrete applied mathematics, 58(2), 1995, pp. 145-156
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
SCHEDULING SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS
Authors: JOZEFOWSKA J JURISCH B KUBIAK W
Citation: J. Jozefowska et al., SCHEDULING SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS, Operations research letters, 16(5), 1994, pp. 277-283
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
Risultati: 1-7 |