A Lagrangian relaxation algorithm for order acceptance and scheduling problem: a globalised robust optimisation approach

References

• Ben-Tal, A., S. Boyd, and A. Nemirovski. 2006. “Extending Scope of Robust Optimization: Comprehensive Robust Counterparts of Uncertain Problems.” Mathematical Programming 107: 63–89. doi:10.1007/s10107-005-0679-z.
   Web of Science ®Google Scholar
• Ben-Tal, A., L. El Ghaoui, and A. Nemirovski. 2009. Robust Optimization. Princeton, NJ: Princeton University Press.
   Google Scholar
• Ben-Tal, A., and A. Nemirovski. 2000. “Robust Solutions of Linear Programming Problems Contaminated with Uncertain Data.” Mathematical Programming 88: 411–424. doi:10.1007/PL00011380.
   Web of Science ®Google Scholar
• Bertsimas, D., and A. Thiele. 2006. “Robust and Data-Driven Optimization: Modern Decision-Making under Uncertainty.” In Tutorials in Operations Research, edited by M. P. Johnson, B. Norman, and N. Secomandi, 95–122. Hanover, MD: INFORMS.
   Google Scholar
• Cesaret, B., C. Oğuz, and F. S. Salman. 2012. “A Tabu Search Algorithm for Order Acceptance and Scheduling.” Computers & Operations Research 39: 1197–1205. doi:10.1016/j.cor.2010.09.018.
   Web of Science ®Google Scholar
• Conejo, A. J., E. Castillo, R. Mínguez, and B. R. García. 2006. Decomposition Techniques in Mathematical Programming. Berlin: Springer-Verlag.
   Google Scholar
• Fisher, M. L. 2004. “The Lagrangian Relaxation Method for Solving Integer Programming Problems.” Management Science 50 (12 supplement): 1861–1871. doi:10.1287/mnsc.1040.0263.
   Google Scholar
• Gabrel, V., C. Murat, and A. Thiele. 2014. “Recent Advances in Robust Optimization: An Overview.” European Journal of Operational Research 235: 471–483. doi:10.1016/j.ejor.2013.09.036.
   Web of Science ®Google Scholar
• Ghosh, J. 1997. “Job Selection in a Heavily Loaded Shop.” Computers & Operations Research 24: 141–145. doi:10.1016/S0305-0548(96)00045-7.
   Web of Science ®Google Scholar
• Hopp, W. J., and M. L. Spearman. 2000. Factory Physics. Columbus, OH: McGraw-Hill/Irwin.
   Google Scholar
• Keskinocak, P., and S. Tayur, 2004. “Due Date Management Policies.” In Handbook of Quantitative Supply Chain Analysis: Modeling in the E-business Era. Boston, CA: Kluwer.
   Google Scholar
• Lewis, H. F., and S. A. Slotnick. 2002. “Multi-Period Job Selection: Planning Work Loads to Maximize Profit.” Computers & Operations Research 29: 1081–1098. doi:10.1016/S0305-0548(00)00105-2.
   Web of Science ®Google Scholar
• Liaw, C.-F., Y.-K. Lin, C.-Y. Cheng, and M. Chen. 2003. “Scheduling Unrelated Parallel Machines to Minimize Total Weighted Tardiness.” Computers & Operations Research 30: 1777–1789. doi:10.1016/S0305-0548(02)00105-3.
   Web of Science ®Google Scholar
• Mestry, S., P. Damodaran, and C.-S. Chen. 2011. “A Branch and Price Solution Approach for Order Acceptance and Capacity Planning in Make-To-Order Operations.” European Journal of Operational Research 211: 480–495. doi:10.1016/j.ejor.2011.01.002.
   Web of Science ®Google Scholar
• Miller, C. E., A. W. Tucker, and R. A. Zemlin. 1960. “Integer Programming Formulation of Traveling Salesman Problems.” Journal of the Association for Computing Machinery 7: 326–329. doi:10.1145/321043.321046.
   Web of Science ®Google Scholar
• Nicholas, J. M. 1998. Competitive Manufacturing Management: Continuous Improvement, Lean Production, Customer-focused Quality. Columbus, OH: McGraw-Hill/Irwin.
   Google Scholar
• Oğuz, C., F. S. Salman, and Z. B. Bilgintürk Yalçın. 2010. “Order Acceptance and Scheduling Decisions in Make-To-Order Systems.” International Journal of Production Economics 125: 200–211. doi:10.1016/j.ijpe.2010.02.002.
   Web of Science ®Google Scholar
• Park, J., S. Nguyen, M. Zhang, and M. Johnston. 2013. “Genetic Programming for Order Acceptance and Scheduling”. IEEE Congress on Evolutionary Computation, Cancún, June 20–23.
   Google Scholar
• Potts, C. N., and L. N. Van Wassenhove. 1985. “A Branch and Bound Algorithm for the Total Weighted Tardiness Problem.” Operations Research 33 (2): 363–377. doi:10.1287/opre.33.2.363.
   Web of Science ®Google Scholar
• Rom, W. O., and S. A. Slotnick. 2009. “Order Acceptance Using Genetic Algorithms.” Computers & Operations Research 36: 1758–1767. doi:10.1016/j.cor.2008.04.010.
   Web of Science ®Google Scholar
• Slotnick, S. A. 2011. “Order Acceptance and Scheduling: A Taxonomy and Review.” European Journal of Operational Research 212: 1–11. doi:10.1016/j.ejor.2010.09.042.
   Web of Science ®Google Scholar
• Slotnick, S. A., and T. E. Morton. 1996. “Selecting Jobs for a Heavily Loaded Shop with Lateness Penalties.” Computers & Operations Research 23: 131–140. doi:10.1016/0305-0548(95)00015-E.
   Web of Science ®Google Scholar
• Slotnick, S. A., and T. E. Morton. 2007. “Order Acceptance with Weighted Tardiness.” Computers & Operations Research 34: 3029–3042. doi:10.1016/j.cor.2005.11.012.
   Web of Science ®Google Scholar
• Smith, J. C., and S. B. Sonuc. 2011. “An Introduction to Integer and Large-Scale Linear Optimization.” Wireless Network Design: International Series in Operations Research & Management Science 158: 65–97.
   Google Scholar
• Stevenson, M., L. C. Hendry, and B. G. Kingsman. 2005. “A Review of Production Planning and Control: The Applicability of Key Concepts to the Make-To-Order Industry.” International Journal of Production Research 43 (5): 869–898. doi:10.1080/0020754042000298520.
   Web of Science ®Google Scholar
• Talla Nobibon, F., and R. Leus. 2011. “Exact Algorithms for a Generalization of the Order Acceptance and Scheduling Problem in a Single-Machine Environment.” Computers & Operations Research 38: 367–378. doi:10.1016/j.cor.2010.06.003.
   Web of Science ®Google Scholar
• Wang, X., X. Xie, and T. C. E. Cheng. 2013. “Order Acceptance and Scheduling in a Two-Machine Flowshop.” International Journal of Production Economics 141: 366–376. doi:10.1016/j.ijpe.2012.08.020.
   Web of Science ®Google Scholar
• Zhong, X., J. Ou, and G. Wang. 2014. “Order Acceptance and Scheduling with Machine Availability Constraints.” European Journal of Operational Research 232 (3): 435–441. doi:10.1016/j.ejor.2013.07.032.
   Web of Science ®Google Scholar