Profit-oriented distributionally robust chance constrained flowshop scheduling considering credit risk

References

• ADB. 2017. Key Indicators for Asia and the Pacific 2017. Available at http://dx.doi.org/10.22617/FLS178890-2.
   Google Scholar
• ADB. 2018. Key Indicators for Asia and the Pacific 2018. Available at http://dx.doi.org/10.22617/FLS189512-3.
   Google Scholar
• Atradius. 2016. Asia Pacific: Protection of Cash flow from Payment Risk at Top of Businesses' Agenda. Available at https://www.prnewswire.com/news-releases/asia-pacific-protection-of-cash-flow-from-payment-risk-at-top-of-businesses-agenda-597699721.html.
   Google Scholar
• Aydilek, A., H. Aydilek, and A. Allahverdi. 2015. “Production in a Two-machine Flowshop Scheduling Environment with Uncertain Processing and Setup Times to Minimize Makespan.” International Journal of Production Research 53 (9): 2803–2819.
   Web of Science ®Google Scholar
• Baker, K. R., and D. Altheimer. 2012. “Heuristic Solution Methods for the Stochastic Flow Shop Problem.” European Journal of Operational Research 216 (1): 172–177.
   Web of Science ®Google Scholar
• Balasubramanian, J., and I. Grossmann. 2002. “A Novel Branch and Bound Algorithm for Scheduling Flowshop Plants with Uncertain Processing Times.” Computers & Chemical Engineering 26 (1): 41–57.
   Web of Science ®Google Scholar
• Bank Polski. 2012. Credit Risk Measurement Methods. Available at http://www.pkobp.pl/raportroczny2012/en/credit-risk-measurement-methods.html.
   Google Scholar
• Bartal, Y., S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, and L. Stougie. 2000. “Multiprocessor Scheduling with Rejection.” SIAM Journal on Discrete Mathematics 13 (1): 64–78.
   Web of Science ®Google Scholar
• Ben-Tal, A., D. D. Hertog, A. D. Waegenaere, B. Melenberg, and G. Rennen. 2013. “Robust Solutions of Optimization Problems Affected by Uncertain Probabilities.” Management Science 59 (2): 341–357.
   Web of Science ®Google Scholar
• Bentaha, M. L., A. Dolgui, O. Battaïa, R. J. Riggs, and J. Hu. 2018. “Profit-oriented Partial Disassembly Line Design: Dealing with Hazardous Parts and Task Processing Times Uncertainty.” International Journal of Production Research 56 (24): 7220–7242.
   Web of Science ®Google Scholar
• Bertsimas, D., V. Gupta, and N. Kallus. 2017. “Robust Sample Average Approximation.” Mathematical Programming 171: 217–282.
   Web of Science ®Google Scholar
• Birge, J. R., and F. Louveaux. 2011. Introduction to Stochastic Programming. New York: Springer Science & Business Media.
   Google Scholar
• Calafiore, G. C., and L. El Ghaoui. 2006. “On Distributionally Robust Chance-constrained Linear Programs.” Journal of Optimization Theory and Applications 130 (1): 1–22.
   Web of Science ®Google Scholar
• Chen, W., M. Sim, J. Sun, and C. P. Teo. 2010. “From Cvar to Uncertainty Set: Implications in Joint Chance-constrained Optimization.” Operations Research 58 (2): 470–485.
   Web of Science ®Google Scholar
• Cheng, Y., and S. Sun. 2009. “Scheduling Linear Deteriorating Jobs with Rejection on a Single Machine.” European Journal of Operational Research 194 (1): 18–27.
   Web of Science ®Google Scholar
• Cheng, S.-R., Y. Yin, C.-H. Wen, W.-C. Lin, C.-C. Wu, and J. Liu. 2017. “A Two-machine Flowshop Scheduling Problem with Precedence Constraint on Two Jobs.” Soft Computing 21 (8): 2091–2103.
   Web of Science ®Google Scholar
• Choi, S., and K. Wang. 2012. “Flexible Flow Shop Scheduling with Stochastic Processing Times: A Decomposition-based Approach.” Computers & Industrial Engineering 63 (2): 362–373.
   Web of Science ®Google Scholar
• Chung, B. D., T. Yao, and B. Zhang. 2012. “Dynamic Traffic Assignment Under Uncertainty: A Distributional Robust Chance-constrained Approach.” Networks & Spatial Economics 12 (1): 167–181.
   Web of Science ®Google Scholar
• Delage, E., and Y. Ye. 2010. “Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-driven Problems.” Operations Research 58 (3): 595–612.
   Web of Science ®Google Scholar
• Dósa, G., and Y. He. 2006. “Scheduling with Machine Cost and Rejection.” Journal of Combinatorial Optimization 12 (4): 337–350.
   Web of Science ®Google Scholar
• El Ghaoui, L., M. Oks, and F. Oustry. 2003. “Worst-case Value-at-risk and Robust Portfolio Optimization: A Conic Programming Approach.” Operations Research 51 (4): 543–556.
   Web of Science ®Google Scholar
• Engels, D. W., D. R. Karger, S. G. Kolliopoulos, S. Sengupta, R. Uma, and J. Wein. 2003. “Techniques for Scheduling with Rejection.” Journal of Algorithms 49 (1): 175–191.
   Web of Science ®Google Scholar
• Epstein, L., and H. Zebedat-Haider. 2011. “Online Scheduling with Rejection and Withdrawal.” Theoretical Computer Science 412 (48): 6666–6674.
   Web of Science ®Google Scholar
• Feng, X., F. Zheng, and Y. Xu. 2016. “Robust Scheduling of a Two-stage Hybrid Flow Shop with Uncertain Interval Processing Times.” International Journal of Production Research 54 (12): 3706–3717.
   Web of Science ®Google Scholar
• Hassett, M. J., and D. Stewart. 2006. Probability for Risk Management. Winsted: Actex Publications.
   Google Scholar
• Hoogeveen, H., M. Skutella, and G. J. Woeginger. 2003. “Preemptive Scheduling with Rejection.” Mathematical Programming 94 (2–3): 361–374.
   Web of Science ®Google Scholar
• Jiang, R., and Y. Guan. 2016. “Data-driven Chance Constrained Stochastic Program.” Mathematical Programming 158 (1–2): 291–327.
   Web of Science ®Google Scholar
• Kasperski, A., A. Kurpisz, and P. Zieliński. 2012. “Approximating a Two-machine Flow Shop Scheduling Under Discrete Scenario Uncertainty.” European Journal of Operational Research 217 (1): 36–43.
   Web of Science ®Google Scholar
• Kwon, K., and T. Cheong. 2014. “A Minimax Distribution-free Procedure for a Newsvendor Problem with Free Shipping.” European Journal of Operational Research 232 (1): 234–240.
   Web of Science ®Google Scholar
• Li, S., and J. Yuan. 2010. “Parallel-machine Scheduling with Deteriorating Jobs and Rejection.” Theoretical Computer Science 411 (40–42): 3642–3650.
   Web of Science ®Google Scholar
• Liefooghe, A., M. Basseur, J. Humeau, L. Jourdan, and E.-G. Talbi. 2012. “On Optimizing a Bi-objective Flowshop Scheduling Problem in An Uncertain Environment.” Computers & Mathematics with Applications 64 (12): 3747–3762.
   Web of Science ®Google Scholar
• Liu, M., C. Chu, Y. Xu, and J. Huo. 2012. “An Optimal Online Algorithm for Single Machine Scheduling to Minimize Total General Completion Time.” Journal of Combinatorial Optimization 23 (2): 189–195.
   Web of Science ®Google Scholar
• Liu, M., X. Liu, F. Chu, F. Zheng, and C. Chu. 2018. “Service-oriented Robust Parallel Machine Scheduling.” International Journal of Production Economics 57 (12): 3814–3830.
   Web of Science ®Google Scholar
• Liu, M., S. Wang, C. Chu, and F. Chu. 2016. “An Improved Exact Algorithm for Single-machine Scheduling to Minimise the Number of Tardy Jobs with Periodic Maintenance.” International Journal of Production Research 54 (12): 3591–3602.
   Web of Science ®Google Scholar
• Lu, L., L. Zhang, and J. Yuan. 2008. “The Unbounded Parallel Batch Machine Scheduling with Release Dates and Rejection to Minimize Makespan.” Theoretical Computer Science 396 (1–3): 283–289.
   Web of Science ®Google Scholar
• Luedtke, J., and S. Ahmed. 2008. “A Sample Approximation Approach for Optimization with Probabilistic Constraints.” SIAM Journal on Optimization 19 (2): 674–699.
   Web of Science ®Google Scholar
• Mourad, N., and J. P. Reilly. 2010. “Minimizing Nonconvex Functions for Sparse Vector Reconstruction.” IEEE Transactions on Signal Processing 58 (7): 3485–3496.
   Web of Science ®Google Scholar
• Nazareth, L., and P. Tseng. 2002. “Gilding the Lily: a Variant of the Nelder-mead Algorithm Based on Golden-section Search.” Computational Optimization and Applications 22 (1): 133–144.
   Web of Science ®Google Scholar
• Pagnoncelli, B. K., S. Ahmed, and A. Shapiro. 2009. “Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications.” Journal of Optimization Theory & Applications142 (2): 399–416.
   Web of Science ®Google Scholar
• Pinedo, M., and K. Hadavi. 1992. Scheduling: Theory, Algorithms and Systems Development. In Operations Research Proceedings. Springer.
   Google Scholar
• Shabtay, D., and N. Gasper. 2012. “Two-machine Flow-shop Scheduling with Rejection.” Computers & Operations Research 39 (5): 1087–1096.
   Web of Science ®Google Scholar
• Shapiro, A. 2017. “Distributionally Robust Stochastic Programming.” SIAM Journal on Optimization27 (4): 2258–2275.
   Web of Science ®Google Scholar
• Shapiro, A., D. Dentcheva, and A. Ruszczyński. 2009. Lectures on Stochastic Programming: Modeling and Theory. New York: SIAM.
   Google Scholar
• So, A. M.-C. 2011. “Moment Inequalities for Sums of Random Matrices and Their Applications in Optimization.” Mathematical Programming 130 (1): 125–151.
   Web of Science ®Google Scholar
• Sun, H., Z. Gao, W. Y. Szeto, J. Long, and F. Zhao. 2014a. “A Distributionally Robust Joint Chance Constrained Optimization Model for the Dynamic Network Design Problem Under Demand Uncertainty.” Networks & Spatial Economics 14 (3–4): 409–433.
   Web of Science ®Google Scholar
• Sun, H., H. Xu, and Y. Wang. 2014b. “Asymptotic Analysis of Sample Average Approximation for Stochastic Optimization Problems with Joint Chance Constraints Via Conditional Value At Risk and Difference of Convex Functions.” Journal of Optimization Theory and Applications 161 (1): 257–284.
   Web of Science ®Google Scholar
• Tsosie, C., and S. Nicastro. 2017. Business Credit Score 101. Available at https://www.nerdwallet.com/blog/small-business/business-credit-score-basics/.
   Google Scholar
• Wagner, M. R. 2008. “Stochastic 0-1 Linear Programming Under Limited Distributional Information.” Operations Research Letters 36 (2): 150–156.
   Web of Science ®Google Scholar
• Wang, K., S. Choi, and H. Qin. 2014. “An Estimation of Distribution Algorithm for Hybrid Flow Shop Scheduling Under Stochastic Processing Times.” International Journal of Production Research 52 (24): 7360–7376.
   Web of Science ®Google Scholar
• Xu, J., Y. Yin, T. Cheng, C.-C. Wu, and S. Gu. 2014. “An Improved Memetic Algorithm Based on a Dynamic Neighbourhood for the Permutation Flowshop Scheduling Problem.” International Journal of Production Research 52 (4): 1188–1199.
   Web of Science ®Google Scholar
• Zhang, Y., R. Jiang, and S. Shen. 2016. Distributionally robust chance-constrained bin packing. Available at https://arxiv.org/pdf/1610.00035.pdf.
   Google Scholar
• Zhang, Y., R. Jiang, and S. Shen. 2018a. “Ambiguous Chance-constrained Binary Programs Under Mean-covariance Information.” SIAM Journal on Optimization 28 (4): 2922–2944.
   Web of Science ®Google Scholar
• Zhang, L., L. Lu, and J. Yuan. 2009. “Single Machine Scheduling with Release Dates and Rejection.” European Journal of Operational Research 198 (3): 975–978.
   Web of Science ®Google Scholar
• Zhang, Y., S. Shen, and S. A. Erdogan. 2018b. “Solving 0–1 Semidefinite Programs for Distributionally Robust Allocation of Surgery Blocks.” Optimization Letters 12 (7): 1503–1521.
   Web of Science ®Google Scholar
• Zheng, F., J. He, F. Chu, and M. Liu. 2018. “A New Distribution-free Model for Disassembly Line Balancing Problem with Stochastic Task Processing Times.” International Journal of Production Research 56 (24): 7341–7353.
   Web of Science ®Google Scholar
• Zymler, S., D. Kuhn, and B. Rustem. 2013. “Distributionally Robust Joint Chance Constraints with Second-order Moment Information.” Mathematical Programming 137 (1–2): 167–198.
   Web of Science ®Google Scholar