AAAAAA
Results:
1-16
|
Results: 16
Authors:
CRAUWELS HAJ
HARIRI AMA
POTTS CN
VANWASSENHOVE LN
Citation: Haj. Crauwels et al., BRANCH-AND-BOUND ALGORITHMS FOR SINGLE-MACHINE SCHEDULING WITH BATCH SET-UP TIMES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME, Annals of operation research, 83, 1998, pp. 59-76
Authors:
CHEN B
POTTS CN
STRUSEVICH VA
Citation: B. Chen et al., APPROXIMATION ALGORITHMS FOR 2-MACHINE FLOW-SHOP SCHEDULING WITH BATCH SETUP TIMES, Mathematical programming, 82(1-2), 1998, pp. 255-271
Authors:
ORMAN AJ
POTTS CN
Citation: Aj. Orman et Cn. Potts, ON THE COMPLEXITY OF COUPLED-TASK SCHEDULING, Discrete applied mathematics, 72(1-2), 1997, pp. 141-154
Authors:
HARIRI AMA
POTTS CN
Citation: Ama. Hariri et Cn. Potts, A BRANCH-AND-BOUND ALGORITHM FOR THE 2-STAGE ASSEMBLY SCHEDULING PROBLEM, European journal of operational research, 103(3), 1997, pp. 547-556
Authors:
CRAUWELS HAJ
POTTS CN
VANWASSENHOVE LN
Citation: Haj. Crauwels et al., LOCAL SEARCH HEURISTICS FOR SINGLE-MACHINE SCHEDULING WITH BATCHING TO MINIMIZE THE NUMBER OF LATE JOBS, European journal of operational research, 90(2), 1996, pp. 200-213
Authors:
ORMAN AJ
POTTS CN
SHAHANI AK
MOORE AR
Citation: Aj. Orman et al., SCHEDULING FOR A MULTIFUNCTION PHASED-ARRAY RADAR SYSTEM, European journal of operational research, 90(1), 1996, pp. 13-25
Authors:
POTTS CN
Citation: Cn. Potts, SCHEDULING IN COMPUTER AND MANUFACTURING SYSTEMS, 2ND EDITION - BLAZEWICZ,J, ECKER,KH, SCHMIDT,G, WEGLARZ,J, The Journal of the Operational Research Society, 47(4), 1996, pp. 592-593
Authors:
CHEN B
GLASS CA
POTTS CN
STRUSEVICH VA
Citation: B. Chen et al., A NEW HEURISTIC FOR 3-MACHINE FLOW-SHOP SCHEDULING, Operations research, 44(6), 1996, pp. 891-898
Authors:
POTTS CN
SEVASTJANOV SV
STRUSEVICH VA
VANWASSENHOVE LN
ZWANEVELD CM
Citation: Cn. Potts et al., THE 2-STAGE ASSEMBLY SCHEDULING PROBLEM - COMPLEXITY AND APPROXIMATION, Operations research, 43(2), 1995, pp. 346-355
Authors:
BELOUADAH H
POTTS CN
Citation: H. Belouadah et Cn. Potts, SCHEDULING IDENTICAL PARALLEL MACHINES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME, Discrete applied mathematics, 48(3), 1994, pp. 201-218
Authors:
GLASS CA
POTTS CN
SHADE P
Citation: Ca. Glass et al., UNRELATED PARALLEL MACHINE SCHEDULING USING LOCAL SEARCH, Mathematical and computer modelling, 20(2), 1994, pp. 41-52
Authors:
GLASS CA
GUPTA JND
POTTS CN
Citation: Ca. Glass et al., LOT STREAMING IN 3-STAGE PRODUCTION PROCESSES, European journal of operational research, 75(2), 1994, pp. 378-394
Authors:
KOVALYOV MY
POTTS CN
VANWASSENHOVE LN
Citation: My. Kovalyov et al., A FULLY POLYNOMIAL-APPROXIMATION SCHEME FOR SCHEDULING A SINGLE-MACHINE TO MINIMIZE TOTAL WEIGHTED LATE WORK, Mathematics of operations research, 19(1), 1994, pp. 86-93
Authors:
HARIRI AMA
POTTS CN
Citation: Ama. Hariri et Cn. Potts, SINGLE-MACHINE SCHEDULING WITH DEADLINES TO MINIMIZE THE WEIGHTED NUMBER OF TARDY JOBS, Management science, 40(12), 1994, pp. 1712-1719
Authors:
GUPTA JND
POTTS CN
Citation: Jnd. Gupta et Cn. Potts, MACHINE SCHEDULING PROBLEMS, European journal of operational research, 70(3), 1993, pp. 269-271
Authors:
MONMA CL
POTTS CN
Citation: Cl. Monma et Cn. Potts, ANALYSIS OF HEURISTICS FOR PREEMPTIVE PARALLEL MACHINE SCHEDULING WITH BATCH SETUP TIMES, Operations research, 41(5), 1993, pp. 981-993
Risultati:
1-16
|