Maximising profit for multiple-product, single-period, single-machine manufacturing under sequential set-up constraints that depend on lot size

References

• Bellman, R. E. 1952. “On the Theory of Dymanic Programming.” Proceedings of the National Academy of Sciences 38: 716–719.
   PubMed Web of Science ®Google Scholar
• Charnsirisakordersl, K., P. M. Griffin, and P. Keskinocak. 2004. “Order Selection and Scheduling with Lead-time Flexibility.” IIE Transactions 36: 697–707.
   Web of Science ®Google Scholar
• Charnsirisakordersl, K., P. M. Griffin, and P. Keskinocak. 2006. “Pricing and Scheduling Decisions with Lead-time Flexibility.” European Journal of Operational Research 171: 153–169.
   Web of Science ®Google Scholar
• Chvatal, V. 1983. Linear Programming. New York: W. H. Freeman.
   Google Scholar
• Dantzing, G. B. 1963. Linear Programming and Extensions. Princeton, NJ: Princeton University Press.
   Google Scholar
• Evers, W. H. 1967. “A New Model for Stochastic Linear Programming.” Management Science 13 (9): 680–693.
   Google Scholar
• Gasparini, F. F., and R. Y. Qassim. 2003. “A Mixed Integer Linear Programming Model for Setup Reduction Superstructures.” International Journal of Production Research 41 (5): 1087–1092.
   Web of Science ®Google Scholar
• Goldratt, E. M. 2009. “Standing on the Shoulders of Gigants-production Concepts versus Production Applications.” The Hitachi Tool Engineering Example, Gestáo and Producáo, Sáo Carlos 16 (3): 333–343.
   Google Scholar
• Gomes, M. C., A. P. Barbosa-Póvoa, and A. Q. Novais. 2005. “Optimal Scheduling for Flexible Job Shop Operation.” International Journal of Production Research 43 (11): 2323–2353.
   Web of Science ®Google Scholar
• Gosh, J. 1997. “Job Selection in a Heavy Loaded Shop.” Computers and Operations Research 24 (2): 141–145.
   Web of Science ®Google Scholar
• Harjunkoski, I., and I. E. Grossmann. 2002. Decomposition Techniques for Multistage Scheduling Problems using Mixed-integer and Constraint Programming Methods. Technical report. 2323–2353. Pittsburgh, PA: Department of chemical engineering, Carnegie Mellon University.
   Google Scholar
• Hillier, F. S., and G. J. Lieberman. 2005. Introduction to Operations Research. 8th ed. New York: McGraw Hill Companies, Inc.
   Google Scholar
• Hung, Y. F., and Y. Ch. Hu. 1998. “Solving Mixed Integer Programming Production Planning Problems with Setups by Shadow Prices Information.” Computers & Operations Research 25 (12): 1027–1042.
   Web of Science ®Google Scholar
• Jain, A. S., and S. Meeran. 1998. A State-of-the-art Review of Job Shop Scheduling Techniques. Technical report, October 3rd. Dundee: University of Dundee.
   Google Scholar
• Jain, A. S., and S. Meeran. 1999. “Deterministic Job-shop Scheduling: Past, Present and Future.” Theory and Methodology, European Journal of Operational Research 113: 390–434.
   Web of Science ®Google Scholar
• Kovalev, S., X. Delorme, and A. Dolgui. 2012. “Line Configuration to Minimize Setup Cost.” Mathematical and Computer Modeling 55: 2087–2095.
   Web of Science ®Google Scholar
• Lewis, H. F., and S. A. Slotnick. 2002. “Multi-period Job Selection: Planning Work Loads to Maximize Profit.” Computers and Operations Research 29: 1081–1098.
   Web of Science ®Google Scholar
• Monden, Y. 1998. Toyota Production System: An Integrated Approach to Just-in-Time. 3rd ed. Norcross, GA: Engineering and Management Press.
   Google Scholar
• Nemhauser, G. L., and L. A. Wolsey. 1988. Integer and Combinatorial Optimization. New York: John Wiley and sons.
   Google Scholar
• Nobibon, F. T., and E. Leus. 2011. “Exact Algorithms for a Generalization of the Order Acceptance and Scheduling Problem in a Single-machine Environment.” Computers and Operations Research 38: 367–378.
   Web of Science ®Google Scholar
• Oguz, C., F. S. Salman, and Z. B. Yalçin. 2010. “Order Acceptance and Scheduling Decisions in Make-to-order Systems.” International Journal of Production Economics 125 (1): 200–211.
   Web of Science ®Google Scholar
• Pinedo, M. L. 2012. Scheduling: Theory, Algorithms, and Systems. 4th ed. New York: Springer.
   Google Scholar
• Reklaitis, G. V. 1996. “Overview of Scheduling and Planning of Batch Process Operations.” Batch Processing Systems Engineering: Fundamentals and Applications for Chemical Engineering 143: 660–705.
   Google Scholar
• Rockafellar, R. T. 1998. Network Flows and Monotropic Optimization. Belmont, MA: Athena Scientific.
   Google Scholar
• Rom, W. O., and S. A. Slotnick. 2009. “Order Acceptance using Generic Algorithms.” Computers and Operations Research 36: 1758–1767.
   Web of Science ®Google Scholar
• Roshanaei, V., A. K. G. Balagh, M. M. S. Esfahani, and B. Vahdani. 2010. “A Mixed-integer Linear Programming Model Along with an Electromagnetism-like Algorithm for Scheduling Job Shop Production System with Sequence-dependent Set-up Times.” International Journal of Advanced Manufacturing Technology 47: 783–793.
   Web of Science ®Google Scholar
• Slotnick, S. A., and T. E. Morton. 1996. “Selecting Jobs for a Heavily Loaded Shop with Lateness Penalties.” Computers and Operations Research 23 (2): 131–140.
   Web of Science ®Google Scholar
• Slotnick, S. A., and T. E. Morton. 2007. “Order Acceptance with Weighted Tardiness.” Computers and Operations Research 34: 3029–3042.
   Web of Science ®Google Scholar
• Slotnick, S. A. 2010. “Order Acceptance and Scheduling: A Taxonomy and Review.” European Journal of Operational Research 212: 1–11.
   Web of Science ®Google Scholar
• Srikar, B. N., and S. Ghosh. 1986. “A MILP Model for the n-job, M Stage Flowshop with Sequence Dependent Set-up Times.” International Journal Production Research 24 (6): 1459–1474.
   Web of Science ®Google Scholar
• Suri, R. 1998. Quick Response Manufacturing: A Companywide Approach to Reducing Lead Times. New York: Productivity press.
   Google Scholar
• Wäscher, G. H., and H. Schumann Haussner. 2007. “An Improved Typology of Cutting and Packing Problems.” European Journal of Operational Research 183 (3): 1109–1130.
   Web of Science ®Google Scholar
• Yang, B., and J. Geunes. 2003. Heuristic Approaches for Solving Single Resource Scheduling Problems with Job Selection Flexibility. Technical Report, Working Paper. Gainsville, FL: Department of Industrial and Systems Engineering, University of Florida.
   Google Scholar