Curriculum Vita

 

 BAHRAM ALIDAEE

  1. Address:

  2.   School of Business Administration

      Hearin Center for Enterprise Science

      The University of Mississippi
      University, MS 38677
      (662) 915-5466
      Balidaee@bus.olemiss.edu

  3. Education:

  4.     Ph.D., The University of Texas at Arlington, 1988

        Major, Mathematical Sciences

        M.B.A., The University of North Texas, 1981

        Major, Production and Operations Management

        B.S., The University of Tehran, Iran, 1975

        Major, Business Administration

     

  5. Professional Experience:

  6.     2005 - Present, Professor of Operations Management

        1997-2005, Associate Professor of Operations Management,

                School of Business Administration, The University of Mississippi

        1998-2001, Faculty Coordinator, The Hearin Center for Enterprise Science,

                School of Business Administration, The University of Mississippi

        1995-1996, Assistant Professor of Operations Management,

                School of Business Administration, The University of Mississippi

        1988-1995, Assistant, and Associate Professor, West Texas A&M University

     

  7. Professional Affiliation and Awards:

  8. Membership:

    INFORMS, ICS, DSI, POMS, APICS, ISM, IEEE Computing Society

    Member of the Editorial Advisory Board (2007-present)  International Journal of Service Sciences (IJSSCi)

    Member of the Editorial Advisory Board (2000-2002)  Computers & Operations Research

    Award:

    Outstanding Senior Researcher of the year 2006, School of Business Administration,

    The University of Mississippi

    Outstanding Senior Researcher of the year 2003, School of Business Administration,

    The University of Mississippi

    Who's Who in American Education, Marquis Who’s Who, 2004-2005

    Who'sWho in America, Science and Engineering (Marquis Millennium Edition)

    Outstanding Researcher of the Year 1997, School of Business Administration, The University of Mississippi
    Outstanding Researcher of the year, 1995, West Texas A&M University
    Outstanding Researcher of the year, 1992, West Texas A&M University
    Best Student Research Paper Award, 1987, OMEGA/RHO, 

      COURSES TAUGHT  

    Undergraduate:      Operations Management I, II, Management Science, Operations Planning and Control,             

                                    Business Statistics

    Graduate:               PMBA (Professional Online MBA): Decision Making

                                    MBA: Operations Management, Operations Research, Business Statistics, Decision Making

                                    Ph.D.:  Advanced Operations Management, Operations Research,

                                                Integer and Nonlinear Programming, Advanced Management Science,

                                                Operations Scheduling, Applied Linear Statistical Models

     

    Ph.D. DIRECTED

    Gao, Hongman, Expected 2007, Assistant Professor of POM, Kings College (Chair)

    Pirim, Taner, 2006, Super Computer Consultant, University of Mississippi (Chair)

    Lutfu Sagbansua, 2004, Overseas, Turkey (Co-Chair)

    Haibo Wang, 2004, Assistant Professor of MIS, Texas A&M International University (Co-Chair)

    Weiqi Li, 1998, Assistant Professor of MIS, Michigan Technological University  (Co-Chair)

    Jaideep T. Naidu, 1998, Assistant Professor of POM, Philadelphia College of Textiles and Science (Chair)

    Bryan Kethley, 1997, Assistant Professor of POM, Middle Tennessee State University (Chair)

    Chen-Pei Hwang (James), 1996, Sun Microsystems, Silicon Valley, CA (Co-Chair)

        MEDIA INTERVIEWS

        South Central Construction Magazine: Market Outlook, Cover Story, January 2006

        South Central Construction Magazine: Market Outlook, Cover Story, January 2005

 

Areas of Research Interests:


Supply Chain Management, Logistics Management, Service Operations, Emergency and Disaster Operations Management, Cross Training of Workforce, Quality Function Deployment and Product Design, Cooperative Control Optimization, Bioinformatics, Data Mining and Analysis, GIS and Image Processing, Organizational Complexity and Change, Heuristic Programming, Operations Scheduling, Cost Allocations and Game Theory

RESEARCH GRANTS

Co-principal Investigator for several major grants from ONR, and Department of Homeland Security, total of  $4,000,000.00 

Principal Investigator for several grants from University of Mississippi, and Hearin Center for Enterprise Science, total of about $101,000.00  

PUBLICATIONS

Book: Adaptive Memory and Evolution: Tabu Search and Scatter Search (Editors) César Rego and Bahram Alidaee,  Publisher: Kluwer Academic Publisher, 2005 (this is collection of papers related to the Meta-heuristic Conference held during March 2001, at Ole Miss)

 

Peer Reviewed Articles


  1. “A Note on Integer Programming Formulations of the Real-Time Optimal Scheduling and Flight Path Selection of UAVs,” IEEE Transactions on Control Systems Technology, (2008) to appear, (with Wang, H, and Landram, F.)
  2. “An Algorithm for Enhancing Spreadsheet Regression with Out-of-Sample Statistics,” Communications in Statistics - Simulation and Computation, (2008) to appear, (with Landram, F, and Pavur, R.)
  3. “Allocation of Emergency and Recovery Centers in Hidalgo, Mexico,” International Journal of Service Sciences, 2008, to appear (with Ablanedo Rosas, J, Gao, H, and Teng, W.).
  4. “A Conceptual Framework of Agricultural Land Use Planning with BMP for Integrated Watershed Management,” 2008, Journal of American Water Resource Association, 2008, to appear (with Qi, H, Altinakar, M, and Vienira, D.)
  5. A Note on xQx as a Modeling and Solution Framework for the Linear Ordering Problem, 2008, International Journal of Operational Research,, (with Lewis, M., Glover, F. and Kochenberger, G.)
  6. “Clique Partitioning for Clustering: A Comparison with K-means and Latent Class Analysis,”  Vol. 37, 1, 2008,  Communications in Statistics, 37 (1) 1-13. (with Wang, H, Obremski, T, and Kochenberger, G.)
  7. “Simple and fast Surrogate Constraints Heuristics for the Maximum Independent Set Problem,” 2008, Journal of Heuristicsto appear, (with Kochenberger, G and Wang, H.)
  8. A New Approach for Modeling and Solving Set Packing Problems,” European Journal of Operational Research, 2008, 186(2) 504-512. (with Wang, H, G. Kochenberger, G, Lewis, M, Lewis, K.).
  9. "A New Modeling and Solution Approach for the Set Partitioning Problem."  Computers & Operations Research, 2008, Vol. 35, 3, 807-813. (with M. Lewis and G. Kochenberger).
  10.  “Combining Time Series Components for Improved Forecasts,” Decision Sciences (Journal of Innovative Education), 2008, 6(1) 197-204. (with Landram, F and Pavur, R.)
  11. “A Pseudo-Boolean Optimization for Multiple Criteria Decision Making in Complex Systems,” Lecture Notes in Computer Science. no. 4490, (2007): 194-201. (with Wang, H, and Xu, A.)
  12. “Solving Group Technology Problems via Clique Partitioning,” International Journal of Flexible Manufacturing Systems, 2006, 18, 2, 77-97. (with Wang, H, Glover, F, and Kochenberger, G.)
  13. “Solving the Maximum Edge Weight Clique Problem via Unconstrained Quadratic Programming,” European Journal of Operational Research, 2007, 181 (2), 592-597. (with F. Glover, G. Kochenberger and H. Wang).
  14. "An Effective Modeling and Solution Approach for the Generalized Independent Set Problem," Optimization Letters, 2007, 1, 111-117. (with H. Wang, F. Glover and G. Kochenberger). 
  15.  “Clustering of Microarray Data via Clique Partitioning,” Journal of Combinatorial Optimization, 2005, Vol. 10, 77-92. (with G. Kochenberger, F. Glover and H. Wang).
  16. “Using the Unconstrained Quadratic Program to Model and Solve Max 2-SAT Problems, International Journal of Operations Research,” 2005, Vol. 1/2, 89-100. (with G. Kochenberger, F. Glover, K. Lewis) .
  17. “A Note on a Simple Dynamic Programming Approach to the Single-Sink Fixed Charge Transportation Problem,” Transportation Science, 2005, 39, 1, 140-143.(with G. Kochenberger).
  18.  “An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem,” Annals of Operations Research, 2005, 139, Vol. 1, 229-241. (with Kochenberger, Glover and Rego)
  19. “Using xQx to Model and Solve the Uncapacitated Task Allocation Problem”, Operations Research Letters, 2005, Vol. 33, 176-182 (with Lewis, M and Kochenberger, G)
  20. “A New Modeling and Solution  Approach for the Number Partitioning Problem,” Journal of Applied Mathematics and Decision Sciences, 2005, 9, 2, 113-121. (with Kochenberger, Glover and Rego)
  21. “A Unified Modeling and Solution Procedure for Combinatorial Optimization,” OR-Spectrum, 2004, Vol. 26, 237-250. (with Kochenberger, Glover and Rego)  Vol. 26, 237-250.
  22.  “Managerial Issues in Complex Planning Procedures:  A Case Study of QFD,”  In:  Concurrent Engineering Advanced Design, Production and Management Systems, (Eds.) J. Cha, R. Jardim-Goncalves, and A. Steiger-Garcao, Balkema Publisher, Tokyo, 2003.  (with C. Rego and G. Kochenberger)
  23.  “Solving Quadratic Knapsack Problems by Reformulation and Tabu Search.  Single Constraint Case,” In: Combinatorial and Global Optimization, (Eds.) P. Pardalos, A. Migdalas and R. Burkard, 2002, World Scientific, (with F. Glover, G. Kochenberger and M. Amini)
  24. “Solving Combinatorial Optimization Problems via Reformulation and Adaptive Memory Metaheuristics,” ,” In: Revolutionary Visions in Evolutionary Computation,, (Eds.) A. Menon and D. Doldberg, 2002, Kluwer Publisher, (with G. Kochenberger, F. Glover and C. Rego)
  25. “Dynamics of Local Search Heuristics for the TSP,” IEEE Transactions on Systems Man and Cybernetics, Part A, 2002, 32, 173-184. (with Weiqi Li)                             
  26. Single Machine Scheduling to Minimize Total Weighted Late Work: A Comparison of Scheduling Rules and Search Algorithms,  Computers & Industrial Engineering, 2002, 43, no. 3, 509-528. (with B. Kethley)
  27. “Insights Into Two Solution Procedures for the Single Machine Tardiness Problem,” Journal of Operational Research Society, 2002, 53, 800-806. (with J. Naidu and J.N. Gupta)
  28. “An Efficient Approach for Solving the Assignment Problem with Side Constraints” International Journal of Information Technology & Decision Making, 2002, 1, 121-129 (with F. Glover, G. Kochenberger)
  29. “One-pass Heuristic for Large-scale Unconstrained Binary Quadratic Optimization,” European Journal of Operational Research 2002, 137, 272-287. (with F. Glover, G. Kochenberger, and C. Rego)
  30. “Greedy Solutions of Selection and Ordering Problems,” European Journal of Operational Research, 2001, 134,1, 205-217. (with G. Kochenberger)
  31. “A Scatter Search Approach to Unconstrained Binary Quadratic Programming,” In: New Methods in Optimization, (Eds.) Corne, Dringo and Glover. 1999. McGraw-Hill, New York. 1999, 317-329, (with M.M. Amini, and G. Kochenberger)
  32. “A Tour Construction Heuristic for Traveling Salesman Problem,” Journal of Operational Research Society, 1999, 50, 797-809. (with C-P Hwang and J. Johnson)
  33. “Scheduling with Time Dependent Processing Times: Review and Extensions,” Journal of Operational Research Society, 1999, 50, 711-720. (with K.N. Womer)
  34. “Three-person Minimum Spanning Tree Games,” Mathematical & Computer Modeling, 1999, 29, 107-123.
  35. “Adaptive Memory Search for Binary Quadratic Programs,” Management Science, 1998, 44, 336-345. (with F. Glover, G. Kochenberger)
  36. “Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programs,” In: Meta-Heuristics, Advances and Trends in Local Search Paradigms for Optimization,  S. Voss, S. Martello, I. Osman, and C. Roucairol (Eds.), Kluwer, 1999, 93-109. (with Glover, F. G. Kochenberger and M.M. Amini)
  37. “Global Optimization for Artificial Neural Networks: A Tabu Search Application,” European Journal of Operational Research, 1998, 106, 570-584. (with Sexton, R J. Johnson and R. Dorsey.
  38. “A Note on Two Rules for Single Machine Tardiness,” European Journal of Operational Research, 1997,  96, 514-517. (with S. Gopalan)
  39. “A Note on Minimizing the Weighted Sum of Tardy and Early Completion Penalties in a Single Machine: A Case of Small Common Due Date,” European Journal of Operational Research, 1997, 96, 559-563 (with I. Dragan)
  40. “Scheduling Parallel Machines to Minimize Total Weighted and Unweighted Tardiness,” Computers & Operations Research, 1997, 24 (8), 775-788. (with D. Rosa)
  41. “Computing Orthogonal Polynomials,” Computers & Operations Research, 1997, 24 (5), 473-476. (with F. Landram)
  42. “A Note on the Bicriterion Scheduling Problem Involving Total Flow Time and Range of Lateness,” International Journal of Information and Management Sciences, 1997, 8, 2, 1-7. (with. S. Conlon)
  43. “A Framework for Machine Scheduling Problems with Controllable Processing Times,” Production and Operations Management, 1996, 5 (4), 391-405. (with G. Kochenberger)
  44. “Scheduling on a Single Processor with Variable Speed,” Information Processing Letters, 1996, 60, 189-193. (with A. Ahmadian)
  45. “A Computational Experiment of AU_COVERT Class of Rules for Single Machine Tardiness,” Computers & Industrial Engineering, 1996, 30, 201-209. (with R. Ramakrishnan)
  46. “Scheduling Jobs on a Single Machine to Minimize the Maximum Processing Times,” International Journal of Systems Science, 1996, 27, 507-510. (with F. Landram)
  47. “On the V-shaped property in One-machine Scheduling,” Journal of  Operational Research Society, 1995, 46, 128-132. (with D. Rosa)
  48. “Minimizing Absolute and Squared Deviation of Completion Times from Due Date,” Production and Operations Management, 1994, 3 (2) 133-148
  49. “Minimizing Absolute Flow Time Variation in Single and Multiple Machine Scheduling,” Journal of  Operational Research Society, 1994, 45(9),1077-1087 (with G. Kochenberger)
  50. “Optimal Sequencing in Multi characteristics Inspection Policy,” Journal of Optimization Theory and Applications, 1994, 83, 199-205
  51. “0-1 Quadratic Programming Approach for Optimum Solutions of Two Scheduling Problems,” International Journal of Systems Science, 1994, 25, 401-408. (with G. Kochenberger and A. Ahmadian)
  52. “Proof of Permutationally Convexity of MCSF Games,” ZOR Methods and Models of Operations Research, 1994, 39, 243-248
  53. “Two Parallel Machine Sequencing Problems Involving Controllable Job Processing, European Journal of Operational Research, 1993, 70(3), 335-342. (with A. Ahmadian)
  54. Numerical Methods for Single Machine Scheduling with Nonlinear Cost Functions to Minimize Total Cost,” Journal of Operational Research Society, 1993, 44,125-132
  55. “Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-identical Machines,” Journal of Operational Research Society, 1993, 44, 29-36. (with S. Panwalkar)
  56. “Scheduling of n Jobs on Two Identical Machines to Minimize Weighted Mean Flow Time,” Computers & Industrial Engineering, 1992, 24, 53-55.
  57. “Maximizing Set Function Formulation of Two Scheduling Problems,” ZOR Methods and Models of Operations Research, 1992, 36, 409-416
  58. “Optimal Assignment of NOP Due-Dates and Sequencing in a Single Machine Shop,” ZOR Methods and Models of Operations Research, 1992, 36, 333-341
  59. “Weighted Earliness Tardiness Problem in Single Machine,” International Journal of Engineering, 1992, 3,63-75. (with A. Ahmadian)
  60. “Single Machine Scheduling with Nonlinear Cost Functions,” Computers & Operations Research, 1991, 18 (3), 317-323
  61. “A Note on Permutationally Convex Games,” Theory and Decision, 1991, 30, 109-111
  62. “Optimal Assignment of Slack Due Date and Sequencing in a Single Machine Shop,” Applied Mathematics Letters, 1991, 4 (2), 9-11
  63. “A Heuristic Solution Procedure to Minimize Makespan in Single Machine Scheduling,” Journal of Operational Research Society, 1990, 41(11), 1065-1068.
  64.  “Analyzing Total Cost for a Single Machine and n Jobs by use of a Symmetric Matrix Arising from a Quadratic Form of Service Times,” The Logistics and Transportation Review, 1989, 24(4), 367-374.

 

RELATED ARTICLES (REFEREED)

  1. Grierstorfer,P.,  C. Rego, and B. Alidaee, “A Filter-and-Fan Approach for the Facility Location Problem,” Proceedings of The Fifth Metaheuristics International Conference, Koyoto, Japan, August 25-28, 2003.
  2. Alidaee, B. “Inventory Control” Managerial and Decision Economics, 2000, 21, 207.
  3. Naidu, J, and., B. Alidaee. A New Hybrid heuristic to Minimize the Single Machine Total Tardiness, Proceedings of 28th Annual Meeting of DSI, San Diego, CA, November 1997.
  4. Hwang, C-P, B. Alidaee, and J. Johnson., Comparison of Recent Metaheuristic Procedures for Large Traveling Salesman Problem, Proceedings of 27th Annual Meeting of DSI, Orlando, FL, November 1996.
  5. Chou, D, and B. Alidaee. A Comparison Study of Software Quality Control, Proceedings of 26th Annual Meeting of DSI, Boston, MA, 1995, 1700-1702.
  6. Chou, D., and B. Alidaee (1990), A Comparison of the Experimental Behaviors on Inflation and Interest Rates in the US. And West Germany, Proceedings of 21st Annual Meeting of DSI, San Diego, CA, 460-462.
  7. Alidaee, B (1990), Minimizing Weighted Absolute Deviation in a Single Machine Scheduling, Proceedings of 21st Annual Meeting of DSI, South West Region, Dallas, TX, 56-57.
  8. Alidaee, B (1989), Scheduling of n Jobs on a Single Machine Where each Job has a Differentiable Cost Function, Proceedings of 1989 Mountain Plain Management Association, Pueblo, Colorado, 129-140.
  9. Alidaee, B (1989), A New Class of Sequencing Games, Proceedings of 1989 Mountain Plain Management Association, Pueblo, Colorado, 140-150.

CONFERENCE PRESENTATION

  1. Wang, H, Alidaee, B and Xu, Y., “An Attractive Alternative Modeling and Solution Approach for Market Segmentation,” DSI San Antonio, 1006.
  2. Alidaee, B., Kochenberger, G. and Wang, H., “Attractive Nonlinear Models for Clustering and Other Combinatorial Problems,” INFORMS San Francisco, 2005.
  3. Liu, W., Alidaee, B., Wilkins, D., “Tabu Search with New Hybrid Local Search for UQBP Problems, INFORMS San Francisco, 2005.
  4. Alidaee, B., Liu, W, and Wilkins, D. “Multi-exchange neighborhood search strategies for protein side chain positioning,” Twelfth Annual International Conference on Statistics, Combinatorics, Mathematics and Applications, Auburn, December 2005.
  5. Alidaee, B., Liu, W, and Wilkins, D. “Multi-exchange neighborhood search strategies for pseudo-Boolean optimization,” Twelfth Annual International Conference on Statistics, Combinatorics, Mathematics and Applications, Auburn, December 2005.
  6. Wang, H, Alidaee, B and Kochenberger, G, “An Efficient Approach to Group Technology Problem in a Flexible Manufacturing System” INFORMS Denver, 2004.
  7. Wang, H, Alidaee, B and Kochenberger, G, “Local Search Heuristic Algorithms for Complex Network” INFORMS Denver, 2004.
  8. Wang, H., B. Alidaee, and G. Kochenberger, “Evaluating a Clique Partitioning Problem Model for Clustering Data Mining” AMCIS, August 2004
  9. Wang, H., B. Alidaee, G. Kochenberger and F. Glover, “Tabu Search Approach to Scale-free Network”, DSI, Boston, November 2004
  10. Xu, Y., H. Wang, B. Alidaee and G. Kochenberger, “Performance Evaluation of Local Search Heuristic Algorithms for Large Unconstrained Binary Quadratic Programming Problem”, DSI, Boston, November 2004
  11. Alidaee, F. Glover, G. Kochenberger and Lewis, K, “An Application of Filter-and-Fan to Satisfiability Problem,” CORS/INFORMS Banff, Canada, May 2004.
  12. H. Wang, B. Alidaee, G.A. Kochenberger, “A New Methodology for Clustering Genomic and Healthcare Data”, MAS2004, Biloxi, Feb 21, 2004
  13. B. Alidaee “An Expanded QFD Model for Complex Planning with Application to Manpower Planning,” Work Shop, NPRST and University of Mississippi, June, 2003, Oxford, MS
  14. G. Kochenberger, B. Alidaee and H. Wang, “New Methodology for Clustering Data Mining,” INFORMS Atlanta, CA, 2003
  15. G. Kochenberger, F. Glover, B. Alidaee, and H. Wang “The Unconstrained Quadratic Binary Programming Approach to Combinatorial Optimization,” INFORMS Atlanta, CA, 2003
  16. B. Alidaee, and G. Kochenberger, Fast Heuristics for Maximum Independent Set on a Graph, INFORMS San Jose, CA, 2002
  17. K. Pearson, B. Alidaee and C. Rego, “Using Quality Function Deployment in NAVY Manpower Planning:  A Supply Chain Management Approach, Military Personnel Research Conference, June 3-5, 2002, Memphis, TN
  18. Rego, C, Amini, M, Alidaee, B, Glover, F and Kochenberger, G., Scatter Search for Unconstrained Binary Quadratic Program, IFORS 2002, July 8-12, Edinburgh, Scotland
  19. Alidaee, B, P. Ghandforoush, and G. Kochenberger, Fast Heuristics for Very-Large-Scale Maximum Independent Set & Related Problems  Using Neural Networks Approach, INFORMS Miami Beach, FL, 2001
  20. Glover, F, G. Kochenberger and B. Alidaee, New Heuristic Approaches to Graph Optimization & Related Problems, INFORMS Miami Beach, FL, 2001
  21. Alidaee, B F. Glover and G. Kochenberger,  An Effective Solution of Very-Large-Scale Binary Quadratic Programs, INFORMS, San Antonio, 2000
  22. Wang, H, B. Alidaee, and G. Kochenberger, An Improved Parallel Neural Network Solution on the Maximum Clique Problem, INFORMS, San Antonio, 2000
  23. Alidaee, B, F. Glover and G. Kochenberger, One-pass Algorithms for Very Large Binary Quadratic Programs, 17th European Conference on Operations Research, July 16-19, 2000, Budapest, Hungary
  24. Alidaee, B, F. Glover, and G. Kochenberger, Solving the 0/1 Unconstrained Quadratic Programming Problem via the Roof Dual, 17th International Symposium on Mathematical Programming, August 7-11, 2000, Atlanta, GA
  25. Alidaee, B, F. Glover, G. Kochenberger, and H. Wang, The Comparison of Parallel Programming Techniques Applied to the Maximum Clique Problem, 17th International Symposium on Mathematical Programming, August 7-11, 2000, Atlanta, GA
  26. James, T, J. Johnson and B. Alidaee, Distributed Genetic Algorithms for Training Neural Networks on Large Databases for Data Mining Applications, INFORMS, Salt Lake City, 2000
  27. Alidaee, B,  F. Glover and G. Kochenberger, Applications of Binary Quadratic Programming, INFORMS, Salt Lake City, 2000
  28. Alidaee, B, F. Glover and G. Kochenberger, One-pass Algorithms for Binary Quadratic Programming, INFORMS, Salt Lake City, 2000
  29. Alidaee, B, M.M. Amini and G. Kochenberger, Greedy Solutions of Selection and Ordering Problems, INFORMS, Seattle, 1998
  30. Alidaee, B, M.M. Amini, and G. Kochenberger, Application of tabu Search, Scatter Search and the Unconstrained Quadratic Binary Program, INFORMS, Seattle, 1998
  31. Amini, M.M, B. Alidaee, F. Glover, and G. Kochenberger, A New Evolutionary Heuristic Approach to the Quadratic Optimization Problem: A case Study of the Scatter Search, INFORMS, Seattle, 1998
  32. Kochenberger, G, B. Alidaee, and M.M. Amini, Applying Scatter Search and tabu Search to Quadratic Binary Programs, INFORMS, Montreal, 1998
  33. Kochenberger, G., B. Alidaee, and M.M. Amini., A New Scatter Search (Evolutionary) Method for the Zero-One Quadratic Problem, Computer Science Telecommunication Society, INFORMS, Monterey, CA, 1998.
  34. Kethley, B., B. Alidaee. and E. Gillenwater., Signal Machine Scheduling to Minimize Total Weighted Late Work: A Comparison of Traditional Scheduling Rules and the Genetic Algorithm using Taguchi Loss Functions,  28th Annual Meeting of DSI, San Diego, CA, November 1997.
  35. Landram, F., B. Alidaee. V. Shah, and Cook, J., Projected Measures for Spreadsheet Regression,  28th Annual Meeting of DSI, San Diego, CA, November 1997.
  36. Amini, M.M., and B. Alidaee, and M. Racer., Alternative Meta-heuristic Approaches for the Multi-resource Generalized Assignment Problem, INFORMS meeting, Dallas, October 1997.
  37. Naidu, J., B. Alidaee., and E. Gillenwater., Heuristic Approaches to Minimize Tardiness Problems on Single Machine with Sequence Dependent Set-up Times, INFORMS meeting, Dallas, October 1997.
  38. Alidaee, B., M. Amini., and G. Kochenberger., Applications of Unconstraint Binary Quadratic Program, Second International Meta-heuristic Conference, France, Summer 1997.
  39. Landram, F., B. Alidaee. and V. Shah., Testing R2: Confusion or Enlightenment,  27th Annual Meeting of DSI, Orlando, FL, November 1996.
  40. Chen-Pei Hwang. B. Alidaee, and J. Johnson., Applications of the Intelligent Multi-stage System in the Traveling Salesman Problem, INFORMS meeting, Atlanta, GA, October 1996.
  41. Naidu, J., and B. Alidaee. MDD and Decomposition Rules for the Total Tardiness Scheduling Problem, INFORMS meeting, Atlanta, GA, October 1996.
  42. Alidaee, B., Experimental Design for Combinatorial Optimization Problems, INFORMS meeting, New Orleans, LA, October 1995.
  43. Alidaee, B., A Heuristic Algorithm for Minimizing Makespan for Deteriorating Jobs on a Single Machine Scheduling, 25th Annual Meeting of DSI, Honolulu, November 1994.
  44. Alidaee, B., A Modified Due Date Algorithm for Weighted Tardiness Scheduling Problem with m machines, ORSA/TIMS meeting, Detroit, MI, October 1994.
  45. Alidaee, B., and R. Combs. An Algorithmic Note for a Class of Single Machine Scheduling,  24th Annual Meeting of DSI, Washington, D.C., November 1993.
  46. Alidaee, B., A Computational Experiment of COVERT_AU Class of Rules for Single Machine Tardiness Scheduling, ORSA/TIMS meeting, Phoenix, AZ October 1993.
  47. Alidaee, B., Due Date Assignment and Job Scheduling on Parallel Machines, 23rd Annual Meeting of DSI, Sac Francisco, CA., November 1992.
  48. Alidaee, B., Scheduling Deteriorating Jobs on Single Machine, ORSA/TIMS meeting, San Francisco, CA, November 1992.
  49. Alidaee, B., and D. Chou. Minimizing a Bicriterion Scheduling Problem Involving Flow Time and Range of Lateness,  22nd Annual Meeting of DSI, Miami Beach, FL, November 1991.
  50. Alidaee, B., Maximum Cut Set Formulation of Two Scheduling Problems, ORSA/TIMS meeting, Anaheim, CA, October 1991.
  51. Alidaee, B., and D. Chou. Optimal Assignment of NOP Due Date and Sequencing in a Single Machine Shop, ORSA/TIMS meeting, Philadelphia, PA, October 1990.
  52. Alidaee, B., and D. Chou. Simple Algorithm to Minimize Early/Tardy Problem in Single Machine Shop, 21st Annual Meeting of DSI, San Diego, CA, November 1990.
  53. Alidaee, B., An Efficient Algorithm for Minimizing Mean Squared Deviations from a Common Due Date in Single Machine Scheduling, 21st Annual Meeting of DSI, San Diego, CA, November 1990.
  54. Chou, D., and B. Alidaee. An Intelligent Decision Support System for Economic Development Planning Simple Algorithm to Minimize Early/Tardy Problem in Single Machine, ORSA/TIMS meeting, Philadelphia, PA, October 1990.
  55. Alidaee, B., Single Machine Scheduling to Minimize Total Cost with Nonlinear Cost Functions, IFOR 90, Athens, Greece, June 25-29, 1990.
  56. Alidaee, B., Single Machine Scheduling to Minimize Variance, ORSA/TIMS meeting, Las Vegas, March 1990.
  57. Alidaee, B., Minimizing Weighted Absolute Deviation in a Single Machine Scheduling, 21st Annual Meeting of DSI, South West Region, Dallas, TX, February 28-March 3, 1990.
  58. Alidaee, B., Scheduling of n Jobs with a Single Machine to Minimize Total Cost when the Cost Functions are a Polynomial of Degree m, 20th Annual Meeting of DSI, New Orleans, LA, November 1989.
  59. Alidaee, B., A New Class of Sequencing Games, ORSA/TIMS meeting, New York, 1989.
  60. Alidaee, B., Scheduling of n Jobs on a Single Machine Where each Job has a Differentiable Cost Function, Mountain Plain Management Association, Pueblo, Colorado, 1989.
  61. Alidaee, B., A Class of Sequencing Games, Mountain Plain Management Association, Pueblo, Colorado, 1989.
  62. Alidaee, B., An A-Extension of Sequencing Games, OMEGA/RHO Seminar Series, Dallas/Fort Worth Chapter, 1987.