Note from the Editor

References

  • Bean J, Bean M (1985) An integer programming approach to reference staff scheduling. Inform. Process Management 21:459–464.CrossrefGoogle Scholar
  • Bean J, Noon C, Salton G (1987) Asset divestiture at Homart Development Co. Interfaces 17:48–64.LinkGoogle Scholar
  • Bean J, Winocur H, Frick J (1981) The affair between the land developer and the management scientist. Interfaces 11:50–56.LinkGoogle Scholar
  • Bean J, Noon C, Ryan S, Salton G (1990) Selecting tenants in a shopping mall. Interfaces, 18:1–9. Render B, Stair R, Greenberg I, eds. Feature article. Reprinted in Cases and Readings in Management Science (Allyn & Bacon, Boston), 1–9.Google Scholar
  • Hadj-Alouane A, Bean J (1997) A genetic algorithm for the multiple-choice integer program. Oper. Res. 45:92–101.LinkGoogle Scholar
  • Hadj-Alouane A, Bean J, Murty K (1999) A hybrid genetic/optimization algorithm for a task allocation problem. J. Sched. 2:189–201.CrossrefGoogle Scholar
  • Noon C, Bean J (1991) A Lagrangian based approach to the asymmetric generalized traveling salesman problem. Oper. Res. 39:623–632.LinkGoogle Scholar
  • Norman B, Bean J (1999) A genetic algorithm methodology for complex scheduling problems. Naval Res. Logist. 46:199–211.CrossrefGoogle Scholar
  • Norman B, Bean J (2000) Scheduling operations on parallel machine tools. IIE Trans. 32:449–459.CrossrefGoogle Scholar
  • Xu S, Bean J (2016) Scheduling parallel-machine batch operations to maximize on-time delivery performance. J. Sched. 19:583–600.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.