Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

Novel integer L-shaped method for parallel machine scheduling problem under uncertain sequence-dependent setups

Published: 19 September 2024 Publication History

Abstract

We study scheduling problems on unrelated parallel machines with uncertainty in job processing and sequence-dependent setup times. We first formulate this problem as a two-stage stochastic program using a scenario-based approach, in which the first-stage decisions involve job-machine assignments, and the second-stage deals with job sequencing. We then propose an innovative modified integer L-shaped method, uniquely designed to decompose the primary problem into independent subproblems at both the scenario and machine levels. We have augmented this method with a specialized integer optimality cut, which is further strengthened using a sequential lifting procedure. To broaden the applicability of our model and solution, we have adapted it to a distributionally robust optimization (DRO) framework under Wasserstein ambiguity. This process involves reformulating the DRO model into a mixed-integer linear program (MILP) using conic duality theory. Additionally, we integrate a distribution separation program to define the worst-case probability distribution during each iteration of the proposed integer L-shaped method, enhancing the computational speed for solving the DRO model. We conducted a series of numerical experiments to illustrate the effectiveness and scalability of the proposed solution methodology, which demonstrated highly promising results. Our innovative decomposition algorithms showed superior performance, achieving solution times that are significantly faster (up to two orders of magnitude) compared to the traditional integer L-shaped method for the stochastic scheduling model and the direct MILP reformulation of the DRO model. These results were obtained for problem instances solved to the exactness within the time limit. Moreover, the solution derived from the DRO model exhibited greater robustness in out-of-sample analysis with simulated data compared to the solution obtained from the stochastic model.

Highlights

Novel integer L-shaped method with sequential lifting introduced.
Extended to DRO with Wasserstein ambiguity, solved as a mixed integer program.
Numerical tests show enhanced scalability and speed.
DRO solutions provide superior robustness in out-of-sample performance.

References

[1]
Allahverdi A., The third comprehensive survey on scheduling problems with setup times/costs, European Journal of Operational Research 246 (2) (2015) 345–378.
[2]
Allahverdi A., Ng C.-T., Cheng E., Kovalyov M., A survey of scheduling problems with setup times or costs, European Journal of Operational Research 187 (3) (2008) 985–1032.
[3]
Angulo G., Ahmed S., Dey S.S., Improving the integer L-shaped method, INFORMS Journal on Computing 28 (3) (2016) 483–499.
[4]
Avalos-Rosales O., Angel-Bello F., Alvarez A., Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times, International Journal of Advanced Manufacturing Technology 76 (2015) 1705–1718.
[5]
Balakrishnan N., Kanet J.J., Sridharan V., Early/tardy scheduling with sequence dependent setups on uniform parallel machines, Computers & Industrial Engineering 26 (1999) 127–141.
[6]
Bansal M., Huang K.L., Mehrotra S., Decomposition algorithms for two-stage distributionally robust mixed binary programs, SIAM Journal on Optimization 28 (3) (2018) 2360–2383.
[7]
Ben-Tal A., El Ghaoui L., Nemirovski A., Robust optimization, Princeton University Press, 2009.
[8]
Birge J.R., Louveaux F., Introduction to stochastic programming, 2nd ed., Springer Science & Business Media, 2011.
[9]
Bruni M.E., Khodaparasti S., Demeulemeester E., The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times, Computers & Operations Research 123 (2020).
[10]
Chang Z., Song S., Zhang Y., Ding J.Y., Zhang R., Distributionally robust single machine scheduling with risk aversion, European Journal of Operational Research 256 (1) (2017) 261–274.
[11]
Chang Z., Song S., Zhang Y., Ding J.Y., Zhang R., Distributionally robust scheduling on parallel machines under moment uncertainty, European Journal of Operational Research 272 (3) (2019) 832–846.
[12]
Conde E., A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines, Optimization Letters 8 (4) (2014) 1577–1589.
[13]
Conforti M., Cornuejols G., Zambelli G., Integer programming, Springer, 2014.
[14]
Daniels R., Kouvelis P., Robust scheduling to hedge against processing time uncertainty in single-stage production, Management Science 41 (2) (1995) 363–376.
[15]
Delage E., Ye Y., Distributionally robust optimization under moment uncertainty with application to data-driven problems, Operations Research 58 (3) (2010) 595–612.
[16]
Drwal M., Rischke R., Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion, Operations Research Letters 44 (3) (2016) 354–358.
[17]
Erdoğan E., Iyengar G., Ambiguous chance constrained problems and robust optimization, Mathematical Programming 107 (1–2) (2006) 37–61.
[18]
Ertem M., Ozcelik F., Saraç T., Single machine scheduling problem with stochastic sequence-dependent setup times, International Journal of Production Research 57 (10) (2019) 3273–3289.
[19]
Esfahani P.M., Kuhn D., Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations, Mathematical Programming 171 (1–2) (2018) 115–166.
[20]
Fanjul-Peyro L., Ruiz R., Perea F., Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times, Computers & Operations Research 101 (2019) 173–182.
[21]
Gao R., Kleywegt A.J., Distributionally robust stochastic optimization with Wasserstein distance, 2016, arXiv preprint arXiv:1604.02199.
[22]
Glass C., Potts C., Shade P., Unrelated parallel machine scheduling using local search, Mathematical and Computer Modelling 20 (2) (1994) 41–52.
[23]
Goh J., Sim M., Distributionally robust optimization and its tractable approximations, Operations Research 58 (4) (2010) 902–917.
[24]
Hanasusanto G.A., Roitch V., Kuhn D., Wiesemann W., Ambiguous joint chance constraints under mean and dispersion information, 2015, Working Paper: Available at Optimization Online.
[25]
Hanasusanto G.A., Roitch V., Kuhn D., Wiesemann W., A distributionally robust perspective on uncertainty quantification and chance constrained programming, Mathematical Programming 151 (1) (2015) 35–62.
[26]
Hashemi-Amiri O., Ghorbani F., Ji R., Integrated supplier selection, scheduling, and routing problem for perishable product supply chain: A distributionally robust approach, Computers & Industrial Engineering 175 (2023).
[27]
Hu Z., Hong L.J., So A.M., Ambiguous probabilistic programs, 2013, Working Paper.
[28]
Ji R., Lejeune M.A., Data-driven optimization of ambiguous reward-risk ratio measures, INFORMS Journal on Computing 33 (3) (2020) 1120–1137.
[29]
Ji R., Lejeune M.A., Fan Z., Distributionally robust portfolio optimization with linearized STARR performance measure, Quantitative Finance 22 (1) (2022) 113–127.
[30]
Jiang R., Guan Y., Data-driven chance constrained stochastic program, Mathematical Programming 158 (1–2) (2016) 291–327.
[31]
Jiang Z., Ji R., Dong S., A distributionally robust chance-constrained model for humanitarian relief network design, OR Spectrum 45 (4) (2023) 1153–1195.
[32]
Kramer A., Iori M., Lacomme P., Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization, European Journal of Operational Research 289 (3) (2021) 825–840.
[33]
Kurz M., Askin R., Heuristic scheduling of parallel machines with sequence-dependent setup times, International Journal of Production Research 39 (16) (2001) 3747–3769.
[34]
Laporte G., Louveaus F.V., The integer L-shaped method for stochastic integer programs with complete recourse, Operations Research Letters 13 (1993) 133–142.
[35]
Lenstra J., Kan A., Brucker P., Complexity of machine scheduling problems, Annals of Discrete Mathematics 1 (1977) 343–362.
[36]
Liu C.Y., Chang S.C., Scheduling flexible flow shops with sequence-dependent setup effects, IEEE Transactions on Robotics and Automation 16 (2000) 408–419.
[37]
Liu X., Chu F., Zheng C., Liu M., Parallel machine scheduling with stochastic release times and processing times, International Journal of Production Research 59 (20) (2021) 6327–6346.
[38]
McKay K.N., Safayeni F.R., Buzacott J.A., Job-shop scheduling theory: What is relevant?, Interfaces 18 (4) (1988) 84–90.
[39]
Monkman S.K., Morrice D.J., Bard J.F., A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs, European Journal of Operational Research 187 (3) (2008) 1100–1114.
[40]
Munoz L., Villalobos J.R., Fowler J.W., Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times, Computers & Operations Research 143 (2022).
[41]
Niu S., Song S., Ding J.Y., Zhang Y., Chiong R., Distributionally robust single machine scheduling with the total tardiness criterion, Computers & Operations Research 101 (2019) 13–28.
[42]
Novak A., Gnatowski A., Sucha P., Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations, European Journal of Operational Research (2022).
[43]
Pei Z., Lu H., Jin Q., Zhang L., Target-based distributionally robust optimization for single machine scheduling, European Journal of Operational Research 299 (2) (2022) 420–431.
[44]
Pflug G.C., Wozabal D., Ambiguity in portfolio selection, Quantitative Finance 7 (4) (2007) 435–442.
[45]
Pinedo M., Stochastic scheduling with release dates and due dates, Operations Research 31 (3) (1983) 559–572.
[46]
Postek K., Den Hertog D., Melenberg B., Computationally tractable counterparts of distributionally robust constraints on risk measures, SIAM Review 58 (4) (2016) 603–650.
[47]
Rabadi G., Moraga R., Al-Salem A., Heuristics for the unrelated parallel machine scheduling problem with setup times, Journal of Intelligent Manufacturing 17 (1) (2006) 85–97.
[48]
Ren K., Bidkhori H., A study of data-driven distributionally robust optimization with incomplete joint data under finite support, European Journal of Operational Research 305 (2) (2023) 754–765.
[49]
Ryu M., Jiang R., Nurse staffing under absenteeism: A distributionally robust optimization approach, 2019, arXiv preprint arXiv:1909.09875.
[50]
Scarf H., Arrow K.J., Karlin S., A min–max solution of an inventory problem, Studies in the Mathematical Theory of Inventory and Production 10 (1958) 201–209.
[51]
Shapiro A., On duality theory of conic linear problems, Semi-Infinite Programming: Recent Advances (2001) 135–165.
[52]
Shapiro A., Dentcheva D., Ruszczyński A., Lectures on stochastic programming: Modeling and theory (Vol. 16), 2nd ed., SIAM, 2014.
[53]
Shehadeh K.S., Cohn A.E., Jiang R., A distributionally robust optimization approach for outpatient colonoscopy scheduling, European Journal of Operational Research 283 (2) (2020) 549–561.
[54]
Shr A., Liu A., Chen P.P., Load balancing among photolithography machines in the semiconductor manufacturing system, Journal of Information Science and Engineering 24 (2) (2008).
[55]
Skutella M., Uetz M., Stochastic machine scheduling with precedence constraints, SIAM Journal on Computing 314 (4) (2005) 788–802.
[56]
Tran T., Araujo A., Beck C., Decomposition methods for the parallel machine scheduling problem with setups, INFORMS Journal on Computing 28 (1) (2016) 83–95.
[57]
Vallada E., Ruiz R., A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times, European Journal of Operational Research 211 (3) (2011) 612–622.
[58]
Van Der Heyden L., Scheduling jobs with exponential processing and arrival times on identical processors so as to minimize the expected makespan, Mathematics of Operations Research 6 (2) (1981) 305–312.
[59]
Wiesemann W., Kuhn D., Sim M., Distributionally robust convex optimization, Operations Research 62 (6) (2014) 1358–1376.
[60]
Wu X., Zhou X., Stochastic scheduling to minimize expected maximum lateness, European Journal of Operational Research 190 (1) (2008) 103–115.
[61]
Xu X., Cui W., Lin J., Qian Y., Robust makespan minimisation in identical parallel machine scheduling problem with interval data, International Journal of Production Research 51 (12) (2013) 3532–3548.
[62]
Yan B., Chen H.Y., Luh P.B., Wang S., Chang J., Litho machine scheduling with convex hull analyses, IEEE Transactions on Robotics and Automation 10 (4) (2013) 928–937.
[63]
Yanıkoğlu İ., Yavuz T., Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times, European Journal of Operational Research 301 (3) (2022) 875–895.
[64]
Zhang Y., Shen Z.J.M., Song S., Exact algorithms for distributionally β −robust machine scheduling with uncertain processing times, INFORMS Journal on Computing 30 (4) (2018) 662–676.
[65]
Zhao C., Guan Y., Data-driven risk-averse stochastic optimization with Wasserstein metric, Operations Research Letters 46 (2) (2018) 262–267.
[66]
Zhu Z., Heady R.B., Minimizing the sum of earliness/tardiness in multi-machine scheduling: A mixed integer programming approach, Computers & Industrial Engineering 38 (2000) 297–305.
[67]
Zymler S., Kuhn D., Rustem B., Distributionally robust joint chance constraints with second-order moment information, Mathematical Programming 137 (1–2) (2013) 167–198.

Index Terms

  1. Novel integer L-shaped method for parallel machine scheduling problem under uncertain sequence-dependent setups
          Index terms have been assigned to the content through auto-classification.

          Recommendations

          Comments

          Please enable JavaScript to view thecomments powered by Disqus.

          Information & Contributors

          Information

          Published In

          cover image Computers and Industrial Engineering
          Computers and Industrial Engineering  Volume 193, Issue C
          Jul 2024
          1260 pages

          Publisher

          Pergamon Press, Inc.

          United States

          Publication History

          Published: 19 September 2024

          Author Tags

          1. Scheduling
          2. Uncertain processing and setup time
          3. Integer L-shaped method
          4. Sequential lifting
          5. Wasserstein ambiguity

          Qualifiers

          • Research-article

          Contributors

          Other Metrics

          Bibliometrics & Citations

          Bibliometrics

          Article Metrics

          • 0
            Total Citations
          • 0
            Total Downloads
          • Downloads (Last 12 months)0
          • Downloads (Last 6 weeks)0
          Reflects downloads up to 14 Nov 2024

          Other Metrics

          Citations

          View Options

          View options

          Get Access

          Login options

          Media

          Figures

          Other

          Tables

          Share

          Share

          Share this Publication link

          Share on social media