Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Charles E. Wells
1990 – 1999
- 1995
[c1]Ritu Agarwal, Prabuddha De, Charles E. Wells: Cooperative distributed problem solving: an investigation in the domain of jobshop scheduling. HICSS (3) 1995: 4-12- 1993
[j8]Prabuddha De, Jay B. Ghosh, Charles E. Wells: On the general solution for a class of early/tardy problems. Computers & OR 20(2): 141-149 (1993)
[j7]Prabuddha De, Jay B. Ghosh, Charles E. Wells: Delivery time quotation and order processing with forbidden early shipments. Computers & OR 20(4): 381-390 (1993)- 1991
[j6]Prabuddha De, Jay B. Ghosh, Charles E. Wells: On the minimization of the weighted number of tardy jobs with random processing times and deadline. Computers & OR 18(5): 457-463 (1991)
[j5]Prabuddha De, Jay B. Ghosh, Charles E. Wells: Scheduling to minimize weighted earliness and tardiness about a common due-date. Computers & OR 18(5): 465-475 (1991)
[j4]Prabuddha De, Jay B. Ghosh, Charles E. Wells: Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine. Computers & OR 18(8): 717-720 (1991)- 1990
[j3]Prabuddha De, Jay B. Ghosh, Charles E. Wells: Scheduling about a common due date with earliness and tardiness penalties. Computers & OR 17(2): 231-241 (1990)
[j2]Prabuddha De, Jay B. Ghosh, Charles E. Wells: CON due-date determination and sequencing. Computers & OR 17(4): 333-342 (1990)
1980 – 1989
- 1989
[j1]Charles E. Wells, James R. Evans: Statistical procedures for estimating branch flows and total network flow. Networks 19(4): 481-491 (1989)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-25 20:01 CET by the dblp team



