Batching and scheduling in a continuous-discrete hybrid flowshop: Lagrangian relaxation-based heuristic algorithms

References

• Ackermann, S., Y. Fumero, and J. M. Montagna. 2021. “New Problem Representation for the Simultaneous Resolution of Batching and Scheduling in Multiproduct Batch Plants.” Industrial and Engineering Chemistry Research 60 (6): 2523–2535.
   Web of Science ®Google Scholar
• Alfieri, A., A. Druetto, A. Grosso, and F. Salassa. 2021. “Column Generation for Minimizing Total Completion Time in a Parallel-Batching Environment.” Journal of Scheduling 24 (6): 569–588.
   Web of Science ®Google Scholar
• Amin-Naseri, M. R., and M. A. Beheshti-Nia. 2009. “Hybrid Flow Shop Scheduling with Parallel Batching.” International Journal of Production Economics 117 (1): 185–196.
   Web of Science ®Google Scholar
• Azizoglu, M., and S. Webster. 2000. “Scheduling a Batch Processing Machine with Non-identical Job Sizes.” International Journal of Production Research 38 (10): 2173–2184.
   Web of Science ®Google Scholar
• Bragin, M. A., P. B. Luh, J. H. Yan, N. Yu, and G. A. Stern. 2015. “Convergence of the Surrogate Lagrangian Relaxation Method.” Journal of Optimization Theory and Applications 164 (1): 173–201.
   Web of Science ®Google Scholar
• Brucker, P. 2007. Scheduling Algorithms. 5th ed. Berlin: Springer.
   Google Scholar
• Castro, P. M., A. P. Barbosa-Póvoa, H. A. Matos, and A. Q. Novais. 2004. “Simple Continuous-Time Formulation for Short-Term Scheduling of Batch and Continuous Processes.” Industrial and Engineering Chemistry Research 43 (1): 105–118.
   Web of Science ®Google Scholar
• Chen, H., C. Chu, and J. M. Proth. 1998. “An Improvement of the Lagrangean Relaxation Approach for Job Shop Scheduling: A Dynamic Programming Method.” IEEE Transactions on Robotics and Automation 14 (5): 786–795.
   Google Scholar
• Chen, B., and C. Y. Lee. 2008. “Logistics Scheduling with Batching and Transportation.” European Journal of Operational Research 189 (3): 871–876.
   Web of Science ®Google Scholar
• Chen, H., and P. B. Luh. 2003. “An Alternative Framework to Lagrangian Relaxation Approach for Job Shop Scheduling.” European Journal of Operational Research 149 (3): 499–512.
   Web of Science ®Google Scholar
• Costa, A., F. A. Cappadonna, and S. Fichera. 2014. “A Novel Genetic Algorithm for the Hybrid Flow Shop Scheduling with Parallel Batching and Eligibility Constraints.” The International Journal of Advanced Manufacturing Technology 75 (5): 833–847.
   Web of Science ®Google Scholar
• Dobson, G., and R. S. Nambimadom. 2001. “The Batch Loading and Scheduling Problem.” Operations Research 49 (1): 52–65.
   Web of Science ®Google Scholar
• Epstein, L., and A. Levin. 2008. “Minimum Weighted Sum Bin Packing.” In International Workshop on Approximation and Online Algorithms, edited by C. Kaklamanis and M. Skutella, Vol. 4927 of Lecture Notes in Computer Science, 218–231. Berlin: Springer.
   Google Scholar
• Fowler, J. W., and L. Mönch. 2022. “A Survey of Scheduling with Parallel Batch (p-batch) Processing.” European Journal of Operational Research 298 (1): 1–24.
   Web of Science ®Google Scholar
• Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. R. Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” In Annals of Discrete Mathematics, Vol. 5, 287–326. Amsterdam: Elsevier.
   Google Scholar
• Guo, Q., L. Tang, J. Liu, and S. Zhao. 2021. “Continuous-Time Formulation and Differential Evolution Algorithm for an Integrated Batching and Scheduling Problem in Aluminium Industry.” International Journal of Production Research 59 (10): 3169–3184.
   Web of Science ®Google Scholar
• Hopp, W. J. 2008. Supply Chain Science. New York: McGraw-Hill.
   Google Scholar
• Lenstra, J. K., A. R. Kan, and P. Brucker. 1977. “Complexity of Machine Scheduling Problems.” In Annals of Discrete Mathematics, Vol. 1, 343–362. Amsterdam: Elsevier.
   Google Scholar
• Lin, X., C. A. Floudas, S. Modi, and N. M. Juhasz. 2002. “Continuous-Time Optimization Approach for Medium-Range Production Scheduling of a Multiproduct Batch Plant.” Industrial and Engineering Chemistry Research 41 (16): 3884–3906.
   Web of Science ®Google Scholar
• Luh, P. B., and D. J. Hoitomt. 1993. “Scheduling of Manufacturing Systems Using the Lagrangian Relaxation Technique.” IEEE Transactions on Automatic Control 38 (7): 1066–1079.
   Web of Science ®Google Scholar
• Maravelias, C. T., and I. E. Grossmann. 2003. “New General Continuous-Time State-Task Network Formulation for Short-Term Scheduling of Multipurpose Batch Plants.” Industrial and Engineering Chemistry Research 42 (13): 3056–3074.
   Web of Science ®Google Scholar
• Martins, L. D. C., E. M. Gonzalez-Neira, S. Hatami, A. A. Juan, and J. R. Montoya-Torres. 2021. “Combining Production and Distribution in Supply Chains: The Hybrid Flow-Shop Vehicle Routing Problem.” Computers and Industrial Engineering 159: 107486.
   Web of Science ®Google Scholar
• Mehta, S. V., and R. Uzsoy. 1998. “Minimizing Total Tardiness on a Batch Processing Machine with Incompatible Job Families.” IIE Transactions 30 (2): 165–178.
   Web of Science ®Google Scholar
• Muter, İ., and T. Öncan. 2021. “Order Batching and Picker Scheduling in Warehouse Order Picking.” IISE Transactions 54: 435–447.
   Web of Science ®Google Scholar
• Nishi, T., Y. Hiranaka, and M. Inuiguchi. 2010. “Lagrangian Relaxation with Cut Generation for Hybrid Flowshop Scheduling Problems to Minimize the Total Weighted Tardiness.” Computers and Operations Research 37 (1): 189–198.
   Web of Science ®Google Scholar
• Nogueira, T. H., A. B. Bettoni, G. T. de Oliveira Mendes, A. G. dos Santos, and M. G. Ravetti. 2020. “Problem on the Integration Between Production and Delivery with Parallel Batching Machines of Generic Job Sizes and Processing Times.” Computers and Industrial Engineering 146: 106573.
   Web of Science ®Google Scholar
• Ozturk, O. 2020. “A Truncated Column Generation Algorithm for the Parallel Batch Scheduling Problem to Minimize Total Flow Time.” European Journal of Operational Research 286 (2): 432–443.
   Web of Science ®Google Scholar
• Ozturk, O. 2022. “When Serial Batch Scheduling Involves Parallel Batching Decisions: A Branch and Price Scheme.” Computers and Operations Research 137: 105514.
   Web of Science ®Google Scholar
• Pei, J., Q. Song, B. Liao, X. Liu, and P. M. Pardalos. 2021. “Parallel-Machine Serial-Batching Scheduling with Release Times under the Effects of Position-Dependent Learning and Time-Dependent Deterioration.” Annals of Operations Research 298 (1): 407–444.
   Web of Science ®Google Scholar
• Potts, C. N., and M. Y. Kovalyov. 2000. “Scheduling with Batching: A Review.” European Journal of Operational Research 120 (2): 228–249.
   Web of Science ®Google Scholar
• Potts, C. N., and L. N. Van Wassenhove. 1992. “Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity.” Journal of the Operational Research Society 43 (5): 395–406.
   Web of Science ®Google Scholar
• Shahvari, O., and R. Logendran. 2017. “An Enhanced Tabu Search Algorithm to Minimize a Bi-Criteria Objective in Batching and Scheduling Problems on Unrelated-Parallel Machines with Desired Lower Bounds on Batch Sizes.” Computers and Operations Research 77: 154–176.
   Web of Science ®Google Scholar
• Shahvari, O., and R. Logendran. 2018. “A Comparison of Two Stage-Based Hybrid Algorithms for a Batch Scheduling Problem in Hybrid Flow Shop with Learning Effect.” International Journal of Production Economics 195: 227–248.
   Web of Science ®Google Scholar
• Shaik, M. A., and C. A. Floudas. 2007. “Improved Unit-Specific Event-Based Continuous-Time Model for Short-Term Scheduling of Continuous Processes: Rigorous Treatment of Storage Requirements.” Industrial and Engineering Chemistry Research 46 (6): 1764–1779.
   Web of Science ®Google Scholar
• Sun, T., Q. C. Zhao, and P. B. Luh. 2007. “On the Surrogate Gradient Algorithm for Lagrangian Relaxation.” Journal of Optimization Theory and Applications 133 (3): 413–416.
   Web of Science ®Google Scholar
• Tang, L., P. B. Luh, J. Liu, and L. Fang. 2002. “Steel-Making Process Scheduling Using Lagrangian Relaxation.” International Journal of Production Research 40 (1): 55–70.
   Web of Science ®Google Scholar
• Tang, L., and G. Wang. 2008. “Decision Support System for the Batching Problems of Steelmaking and Continuous-Casting Production.” Omega 36 (6): 976–991.
   Web of Science ®Google Scholar
• Tang, L., G. Wang, J. Liu, and J. Liu. 2011. “A Combination of Lagrangian Relaxation and Column Generation for Order Batching in Steelmaking and Continuous-Casting Production.” Naval Research Logistics 58 (4): 370–388.
   Web of Science ®Google Scholar
• Tang, L., and Y. Zhao. 2008. “Scheduling a Single Semi-Continuous Batching Machine.” Omega36 (6): 992–1004.
   Web of Science ®Google Scholar
• Uzsoy, R. 1994. “Scheduling a Single Batch Processing Machine with Non-Identical Job Sizes.” The International Journal of Production Research 32 (7): 1615–1635.
   Web of Science ®Google Scholar
• Uzsoy, R. 1995. “Scheduling Batch Processing Machines with Incompatible Job Families.” International Journal of Production Research 33 (10): 2685–2708.
   Web of Science ®Google Scholar
• Wang, S., M. Kurz, S. J. Mason, and E. Rashidi. 2019. “Two-Stage Hybrid Flow Shop Batching and Lot Streaming with Variable Sublots and Sequence-Dependent Setups.” International Journal of Production Research 57 (22): 6893–6907.
   Web of Science ®Google Scholar
• Xuan, H., and L. Tang. 2007. “Scheduling a Hybrid Flowshop with Batch Production At the Last Stage.” Computers and Operations Research 34 (9): 2718–2733.
   Web of Science ®Google Scholar
• Yang, F., M. Davari, W. Wei, B. Hermans, and R. Leus. 2021. “Scheduling A Single Parallel-Batching Machine with Non-Identical Job Sizes and Incompatible Job Families.” Preprint arXiv:2102.02002.
   Google Scholar
• Zhao, X., P. B. Luh, and J. Wang. 1999. “Surrogate Gradient Algorithm for Lagrangian Relaxation.” Journal of Optimization Theory and Applications 100 (3): 699–712.
   Web of Science ®Google Scholar