Parallel branch-and-price algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times
Scheduling problems occur in a broad range of real-world application fields and have attracted a huge set of research articles. However, there is only little research on exact algorithms for scheduling problems, many of which are NP-hard in the strong sense. We investigate the problem on a single ma...
Uloženo v:
| Vydáno v: | Computers & operations research Ročník 173; s. 106804 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.01.2025
|
| Témata: | |
| ISSN: | 0305-0548 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Scheduling problems occur in a broad range of real-world application fields and have attracted a huge set of research articles. However, there is only little research on exact algorithms for scheduling problems, many of which are NP-hard in the strong sense. We investigate the problem on a single machine with a total weighted tardiness objective function and sequence-dependent setup times. First, we adopt a serial branch-and-price algorithm from the literature and present a modified branching strategy and a primal heuristic. Second, we use the potential of parallel computing architectures by presenting two parallel versions of the branch-and-price algorithm. Third, we conduct extensive computational experiments to show that our parallelization approaches provide substantial parallel speedups on well-known benchmark instances from the literature. We further observe that the parallel speedups achieved by our parallel algorithms are very robust among all tested instances.
•We address a single machine scheduling problem with sequence-dependent setup times.•We suggest and implement two exact parallel branch and price algorithms.•The parallelization is applied to dynamic programming to solve the pricing problem.•Computational experiments are performed on an HPC cluster.•We observe an almost linear speedup for a certain range of thread counts. |
|---|---|
| AbstractList | Scheduling problems occur in a broad range of real-world application fields and have attracted a huge set of research articles. However, there is only little research on exact algorithms for scheduling problems, many of which are NP-hard in the strong sense. We investigate the problem on a single machine with a total weighted tardiness objective function and sequence-dependent setup times. First, we adopt a serial branch-and-price algorithm from the literature and present a modified branching strategy and a primal heuristic. Second, we use the potential of parallel computing architectures by presenting two parallel versions of the branch-and-price algorithm. Third, we conduct extensive computational experiments to show that our parallelization approaches provide substantial parallel speedups on well-known benchmark instances from the literature. We further observe that the parallel speedups achieved by our parallel algorithms are very robust among all tested instances.
•We address a single machine scheduling problem with sequence-dependent setup times.•We suggest and implement two exact parallel branch and price algorithms.•The parallelization is applied to dynamic programming to solve the pricing problem.•Computational experiments are performed on an HPC cluster.•We observe an almost linear speedup for a certain range of thread counts. |
| ArticleNumber | 106804 |
| Author | Schryen, Guido Hilmer, Constanze Rauchecker, Gerhard Speckenmeyer, Philipp |
| Author_xml | – sequence: 1 givenname: Philipp orcidid: 0009-0001-6905-0685 surname: Speckenmeyer fullname: Speckenmeyer, Philipp email: philipp.speckenmeyer@upb.de organization: Warburger Str. 100, 33098 Paderborn, Germany – sequence: 2 givenname: Constanze surname: Hilmer fullname: Hilmer, Constanze organization: Unaffiliated, Munich, Germany – sequence: 3 givenname: Gerhard surname: Rauchecker fullname: Rauchecker, Gerhard organization: Unaffiliated, Passau, Germany – sequence: 4 givenname: Guido orcidid: 0000-0003-3794-1413 surname: Schryen fullname: Schryen, Guido organization: Warburger Str. 100, 33098 Paderborn, Germany |
| BookMark | eNp9kEtOAzEMQLMoEm3hAOxygSnJ_DIVK1TxkyrBAtaRJ-PppMokJUmpOAOXJlVZsagXtmz5WfKbkYl1Fgm54WzBGa9vtwvl_CJneZn6umHlhExZwaqMVWVzSWYhbFkKkfMp-XkDD8agoa0Hq4YMbJftvFZIwWyc13EYA-2dp3FAGrTdGKQjqEFbpNFFMPSAejNE7GgE36VxCDSoAbu9Sdt0511rcKSHdIkG_NyjVZh1uEPboY1pFPc7GvWI4Ypc9GACXv_VOfl4fHhfPWfr16eX1f06U0VdxaxpBC7rvO5B9UVbpZerpWClEk0NomhZ2xcpc8h7qATHvAQlWoRacN6LAttiTsTprvIuBI-9VDpC1M5GD9pIzuTRo9zK5FEePcqTx0Tyf2RSNYL_PsvcnRhML31p9DIofZTQaY8qys7pM_QvA22TLg |
| CitedBy_id | crossref_primary_10_1016_j_cor_2025_107214 |
| Cites_doi | 10.1016/j.jpdc.2013.07.023 10.1002/cpe.4019 10.1016/j.ejor.2013.02.024 10.1080/07408179708966311 10.1016/j.cor.2008.06.007 10.1016/j.future.2015.10.009 10.1007/s10479-016-2251-z 10.1109/IPDPS.2011.354 10.1016/j.ejor.2016.08.072 10.1057/palgrave.jors.2601390 10.1016/j.ejor.2015.04.004 10.1287/ijoc.11.1.78 10.1109/TPDS.2008.78 10.1016/S0360-8352(00)00048-6 10.1007/s10951-017-0549-6 10.1080/00207543.2014.883472 10.1016/0305-0548(93)E0021-K 10.1016/j.ejor.2005.11.001 10.1287/opre.46.3.316 10.1287/ijoc.5.1.2 10.1016/j.cor.2011.03.014 10.1016/j.orl.2013.12.012 10.1016/j.ejor.2006.06.060 10.1016/j.parco.2016.01.008 10.1016/j.ejor.2019.11.033 10.1287/opre.42.6.1042 10.1016/j.asoc.2014.12.030 10.1016/j.cor.2017.04.001 10.1590/0101-7438.2019.039.01.0109 10.1016/S0305-0548(98)00051-3 10.1109/ICCCT.2011.6075214 10.1007/s10951-013-0351-z 10.1016/j.cor.2005.07.020 10.1007/s11750-014-0359-3 10.1016/j.cor.2013.04.009 10.1007/s00170-007-0993-0 10.1007/s10898-011-9793-z 10.1002/cpe.2931 10.1016/j.cor.2016.10.008 10.1287/opre.47.6.862 10.1287/ijoc.2016.0693 10.1016/j.jpdc.2010.01.004 10.1016/j.cor.2014.04.009 10.1016/S0305-0483(98)00042-5 10.1007/s00500-018-3014-3 10.12785/amis/080425 10.1109/ITNG.2010.230 10.1007/s00170-007-1023-y 10.1007/s10845-009-0253-2 10.1016/j.cor.2012.07.004 10.1016/j.jcss.2014.06.012 10.1504/IJOR.2013.050538 10.1080/00207543.2013.848305 10.1145/1465482.1465560 10.1145/2983553 |
| ContentType | Journal Article |
| Copyright | 2024 The Author(s) |
| Copyright_xml | – notice: 2024 The Author(s) |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.cor.2024.106804 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| ExternalDocumentID | 10_1016_j_cor_2024_106804 S0305054824002764 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6I. 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAFTH AAIKJ AAKOC AALRI AAOAW AAQXK AARIN AATTM AAXKI AAXUO AAYFN AAYOK ABAOU ABBOA ABDPE ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABWVN ABXDB ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACRPL ACZNC ADBBV ADEZE ADJOM ADMUD ADNMO AEBSH AEFWE AEHXG AEIPS AEKER AENEX AFFNX AFJKZ AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AKRWK ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC BNPGV CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSH SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XPP ZMT ~02 ~G- 9DU AAYWO AAYXX ACLOT ACVFH ADCNI ADGUI AEUPX AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP APXCP CITATION EFKBS EFLBG ~HD |
| ID | FETCH-LOGICAL-c365t-887e9626facf3b510159704c786a73b0bf33b01a2fa571e24ac7bea6711f73eb3 |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001313487100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Sat Nov 29 03:23:47 EST 2025 Tue Nov 18 22:16:24 EST 2025 Sun Apr 06 06:53:29 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Branch-and-price algorithm Weighted tardiness Sequence-dependent setup times Dynamic programming Single machine scheduling Shared-memory parallelization |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c365t-887e9626facf3b510159704c786a73b0bf33b01a2fa571e24ac7bea6711f73eb3 |
| ORCID | 0009-0001-6905-0685 0000-0003-3794-1413 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.cor.2024.106804 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_cor_2024_106804 crossref_primary_10_1016_j_cor_2024_106804 elsevier_sciencedirect_doi_10_1016_j_cor_2024_106804 |
| PublicationCentury | 2000 |
| PublicationDate | January 2025 2025-01-00 |
| PublicationDateYYYYMMDD | 2025-01-01 |
| PublicationDate_xml | – month: 01 year: 2025 text: January 2025 |
| PublicationDecade | 2020 |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2025 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Allahverdi (b7) 2015; 246 Gmys, Mezmaz, Melab, Tuyttens (b34) 2017; 29 Chen, Powell (b24) 1999; 11 Tran, Q.N., 2010. Designing efficient many-core parallel algorithms for all-pairs shortest-paths using CUDA. In: Proceedings of the 7th International Conference on Information Technology: New Generations. ITNG, pp. 7–12. Cicirello (b27) 2009; vol. 52 Akyol, Bayhan (b4) 2008; 37 Gmys, Mezmaz, Melab, Tuyttens (b33) 2016; 59 Anghinolfi, Paolucci (b11) 2008; 5 Ismail, Abd El-Raoof, Abd El-Wahed (b39) 2014; 8 Boyer, El Baz, Elkihel (b17) 2012; 39 Boschetti, Maniezzo, Strappaveccia (b16) 2016; 28 Xu, Lü, Yin, Shen, Buscher (b71) 2014; 50 Gendron, Crainic (b32) 1994; 42 Subramanian, Battarra, Potts (b61) 2014; 52 Sewell, Sauppe, Morrison, Jacobson, Kao (b59) 2012; 54 Wodecki (b69) 2008; 37 Christou, Vassilaras (b25) 2013; 40 Aldasoro, Escudero, Merino, Perez (b6) 2017; 258 Tasgetiren, Pan, Liang (b65) 2009; 36 Tavakkoli-Moghaddam, Aramon-Bajestani (b66) 2009; 22 Liao, Juan (b44) 2007; 34 Nogueira, Carvalho, Ravetti, Souza (b50) 2019; 39 Stivala, Stuckey, Garcia De La Banda, Hermenegildo, Wirth (b60) 2010; 70 Galea, F., Le Cun, B., 2011. A parallel exact solver for the three-index quadratic assignment problem. In: Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum. pp. 1940–1949. Gagné, Price, Gravel (b30) 2002; 53 Chen (b23) 2019; 23 Lin, Hsieh (b45) 2014; 52 Chakroun, Melab, Mezmaz, Tuyttens (b21) 2013; 73 OpenMP (b52) 2015 Amdahl, G.M., 1967. Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of the April 18-20, 1967, Spring Joint Computer Conference. pp. 483–485. Schryen (b58) 2020; 287 Kramer, Subramanian (b40) 2019; 22 Aldasoro, Escudero, Merino, Monge, Perez (b5) 2015; 23 Allahverdi, Ng, Cheng, Kovalyov (b9) 2008; 187 Lee, Bhaskaran, Pinedo (b43) 1997; 29 Balakrishnan, Kanet, Sridharan (b13) 1999; 26 Rauchecker, Schryen (b56) 2018 Graham, Lawler, Lenstra, Kan (b35) 1979; vol. 5 Lopes, de Carvalho (b47) 2007; 176 Rauchecker, G., Schryen, G., 2015. High-Performance Computing for Scheduling Decision Support: A Parallel Depth-First Search Heuristic. In: Proceedings of the 26th Australasian Conference on Information Systems. Adelaide, Australia, pp. 1–13. Tan, Sun, Gao (b63) 2009; 20 Vu, Derbel (b68) 2016; 56 Tanaka, Araki (b64) 2013; 40 Cicirello (b26) 2003 Nogueira, Ramalhinho, de Carvalho, Gomez Ravetti (b51) 2022 Zhu, Heady (b72) 2000; 38 Adel, Bendjoudi, El Baz, Abdelhakim (b1) 2016 Ozden, Smith, Gue (b53) 2017; 85 Carvajal, Ahmed, Nemhauser, Furman, Goel, Shao (b19) 2014; 42 Maleki, Musuvathi, Mytkowicz (b48) 2016; 59 Atakan, Bülbül, Noyan (b12) 2017; 248 Mezmaz, Leroy, Melab, Tuyttens (b49) 2014 Akker, Hoogeveen, Velde (b3) 1999; 47 Lawler (b42) 1977; vol. 1 Crainic, Toulouse (b28) 2003 Xu, Lü, Cheng (b70) 2014; 17 Dias, Tomim, Marques Marcato, Ramos, Brandi, Da Silva Junior, Passos Filho (b29) 2013; 229 Barnhart, Johnson, Nemhauser, Savelsbergh, Vance (b14) 1998; 46 Subramanian, Farias (b62) 2017; 79 AitZai, Boudhar (b2) 2013; 16 Allahverdi, Gupta, Aldowaisan (b8) 1999; 27 Chakroun, Mezmaz, Melab, Bendjoudi (b22) 2013; 25 Hager, Wellein (b37) 2010 Hoffmann, Lienhart (b38) 2008 Lopes, Alvelos, Lopes (b46) 2014 Chakroun, Melab (b20) 2015; 81 Guo, Tang (b36) 2015; 29 Barr, Hickman (b15) 1993; 5 Rashid, H., Novoa, C., Qasem, A., 2010. An evaluation of parallel knapsack algorithms on multicore architectures.. In: Proceedings of the 2010 International Conference on Scientific Computing. pp. 230–235. Kumar, S., Misra, A., Tomar, R.S., 2011. A modified parallel approach to Single Source Shortest Path Problem for massively dense graphs using CUDA. In: Proceedings of the 2nd International Conference on Computer and Communication Technology. ICCCT, pp. 635–639. Bożejko (b18) 2010; 21 Rubin, Ragatz (b57) 1995; 22 Anghinolfi (10.1016/j.cor.2024.106804_b11) 2008; 5 Lopes (10.1016/j.cor.2024.106804_b46) 2014 Subramanian (10.1016/j.cor.2024.106804_b61) 2014; 52 Tanaka (10.1016/j.cor.2024.106804_b64) 2013; 40 Vu (10.1016/j.cor.2024.106804_b68) 2016; 56 Ozden (10.1016/j.cor.2024.106804_b53) 2017; 85 Gagné (10.1016/j.cor.2024.106804_b30) 2002; 53 Mezmaz (10.1016/j.cor.2024.106804_b49) 2014 Tavakkoli-Moghaddam (10.1016/j.cor.2024.106804_b66) 2009; 22 Xu (10.1016/j.cor.2024.106804_b70) 2014; 17 10.1016/j.cor.2024.106804_b10 Dias (10.1016/j.cor.2024.106804_b29) 2013; 229 10.1016/j.cor.2024.106804_b54 Akker (10.1016/j.cor.2024.106804_b3) 1999; 47 Balakrishnan (10.1016/j.cor.2024.106804_b13) 1999; 26 Carvajal (10.1016/j.cor.2024.106804_b19) 2014; 42 10.1016/j.cor.2024.106804_b55 Atakan (10.1016/j.cor.2024.106804_b12) 2017; 248 Boyer (10.1016/j.cor.2024.106804_b17) 2012; 39 Christou (10.1016/j.cor.2024.106804_b25) 2013; 40 Gmys (10.1016/j.cor.2024.106804_b34) 2017; 29 Chen (10.1016/j.cor.2024.106804_b23) 2019; 23 Crainic (10.1016/j.cor.2024.106804_b28) 2003 Lin (10.1016/j.cor.2024.106804_b45) 2014; 52 Lawler (10.1016/j.cor.2024.106804_b42) 1977; vol. 1 Chakroun (10.1016/j.cor.2024.106804_b20) 2015; 81 Cicirello (10.1016/j.cor.2024.106804_b27) 2009; vol. 52 Graham (10.1016/j.cor.2024.106804_b35) 1979; vol. 5 Rubin (10.1016/j.cor.2024.106804_b57) 1995; 22 Allahverdi (10.1016/j.cor.2024.106804_b7) 2015; 246 Allahverdi (10.1016/j.cor.2024.106804_b8) 1999; 27 Boschetti (10.1016/j.cor.2024.106804_b16) 2016; 28 Stivala (10.1016/j.cor.2024.106804_b60) 2010; 70 OpenMP (10.1016/j.cor.2024.106804_b52) 2015 Tasgetiren (10.1016/j.cor.2024.106804_b65) 2009; 36 Liao (10.1016/j.cor.2024.106804_b44) 2007; 34 10.1016/j.cor.2024.106804_b67 AitZai (10.1016/j.cor.2024.106804_b2) 2013; 16 Chakroun (10.1016/j.cor.2024.106804_b21) 2013; 73 Maleki (10.1016/j.cor.2024.106804_b48) 2016; 59 Subramanian (10.1016/j.cor.2024.106804_b62) 2017; 79 Guo (10.1016/j.cor.2024.106804_b36) 2015; 29 Nogueira (10.1016/j.cor.2024.106804_b51) 2022 Barnhart (10.1016/j.cor.2024.106804_b14) 1998; 46 Barr (10.1016/j.cor.2024.106804_b15) 1993; 5 Hoffmann (10.1016/j.cor.2024.106804_b38) 2008 Akyol (10.1016/j.cor.2024.106804_b4) 2008; 37 Chakroun (10.1016/j.cor.2024.106804_b22) 2013; 25 Allahverdi (10.1016/j.cor.2024.106804_b9) 2008; 187 Wodecki (10.1016/j.cor.2024.106804_b69) 2008; 37 Xu (10.1016/j.cor.2024.106804_b71) 2014; 50 Nogueira (10.1016/j.cor.2024.106804_b50) 2019; 39 Rauchecker (10.1016/j.cor.2024.106804_b56) 2018 Schryen (10.1016/j.cor.2024.106804_b58) 2020; 287 Gmys (10.1016/j.cor.2024.106804_b33) 2016; 59 Adel (10.1016/j.cor.2024.106804_b1) 2016 10.1016/j.cor.2024.106804_b31 Bożejko (10.1016/j.cor.2024.106804_b18) 2010; 21 Gendron (10.1016/j.cor.2024.106804_b32) 1994; 42 Lee (10.1016/j.cor.2024.106804_b43) 1997; 29 Chen (10.1016/j.cor.2024.106804_b24) 1999; 11 Kramer (10.1016/j.cor.2024.106804_b40) 2019; 22 Aldasoro (10.1016/j.cor.2024.106804_b6) 2017; 258 Aldasoro (10.1016/j.cor.2024.106804_b5) 2015; 23 Hager (10.1016/j.cor.2024.106804_b37) 2010 Sewell (10.1016/j.cor.2024.106804_b59) 2012; 54 Cicirello (10.1016/j.cor.2024.106804_b26) 2003 Ismail (10.1016/j.cor.2024.106804_b39) 2014; 8 Tan (10.1016/j.cor.2024.106804_b63) 2009; 20 Zhu (10.1016/j.cor.2024.106804_b72) 2000; 38 10.1016/j.cor.2024.106804_b41 Lopes (10.1016/j.cor.2024.106804_b47) 2007; 176 |
| References_xml | – volume: 22 start-page: 21 year: 2019 end-page: 57 ident: b40 article-title: A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems publication-title: J. Sched. – volume: 20 start-page: 261 year: 2009 end-page: 274 ident: b63 article-title: Improving performance of dynamic programming via parallelism and locality on multicore architectures publication-title: IEEE Trans. Parallel Distrib. Syst. – volume: vol. 5 start-page: 287 year: 1979 end-page: 326 ident: b35 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Discrete Optimization II – volume: 34 start-page: 1899 year: 2007 end-page: 1909 ident: b44 article-title: An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups publication-title: Comput. Oper. Res. – reference: Rauchecker, G., Schryen, G., 2015. High-Performance Computing for Scheduling Decision Support: A Parallel Depth-First Search Heuristic. In: Proceedings of the 26th Australasian Conference on Information Systems. Adelaide, Australia, pp. 1–13. – volume: 25 start-page: 1121 year: 2013 end-page: 1136 ident: b22 article-title: Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm publication-title: Concurr. Comput.-Pract. Exp. – volume: 39 start-page: 109 year: 2019 end-page: 154 ident: b50 article-title: Analysis of mixed integer programming formulations for single machine scheduling problems with sequence dependent setup times and release dates publication-title: Pesquisa Oper. – volume: 229 start-page: 212 year: 2013 end-page: 222 ident: b29 article-title: Parallel computing applied to the stochastic dynamic programming for long term operation planning of hydrothermal power systems publication-title: European J. Oper. Res. – volume: 40 start-page: 2387 year: 2013 end-page: 2397 ident: b25 article-title: A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem publication-title: Comput. Oper. Res. – start-page: 290 year: 2014 end-page: 300 ident: b46 article-title: Improving branch-and-price for parallel machine scheduling publication-title: Computational Science and Its Applications – ICCSA 2014 – volume: 28 start-page: 540 year: 2016 end-page: 552 ident: b16 article-title: Using GPU computing for solving the two-dimensional guillotine cutting problem publication-title: INFORMS J. Comput. – volume: 5 start-page: 2 year: 1993 end-page: 18 ident: b15 article-title: Feature article - reporting computational experiments with parallel algorithms: Issues, measures, and experts’ opinions publication-title: INFORMS J. Comput. – volume: 47 start-page: 862 year: 1999 end-page: 872 ident: b3 article-title: Parallel machine scheduling by column generation publication-title: Oper. Res. – volume: 52 start-page: 2729 year: 2014 end-page: 2742 ident: b61 article-title: An iterated local search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times publication-title: Int. J. Prod. Res. – volume: 27 start-page: 219 year: 1999 end-page: 239 ident: b8 article-title: A review of scheduling research involving setup considerations publication-title: Omega – volume: 29 start-page: 45 year: 1997 end-page: 52 ident: b43 article-title: A heuristic to minimize the total weighted tardiness with sequence-dependent setups publication-title: IIE Trans. – volume: 36 start-page: 1900 year: 2009 end-page: 1915 ident: b65 article-title: A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times publication-title: Comput. Oper. Res. – reference: Galea, F., Le Cun, B., 2011. A parallel exact solver for the three-index quadratic assignment problem. In: Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum. pp. 1940–1949. – volume: 258 start-page: 590 year: 2017 end-page: 606 ident: b6 article-title: A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems publication-title: European J. Oper. Res. – volume: 176 start-page: 1508 year: 2007 end-page: 1527 ident: b47 article-title: A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times publication-title: European J. Oper. Res. – volume: 5 start-page: 44 year: 2008 end-page: 60 ident: b11 article-title: A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem publication-title: Int. J. Oper. Res. (Taichung) – volume: vol. 1 start-page: 331 year: 1977 end-page: 342 ident: b42 article-title: A “pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness publication-title: Studies in Integer Programming – volume: 42 start-page: 186 year: 2014 end-page: 189 ident: b19 article-title: Using diversification, communication and parallelism to solve mixed-integer linear programs publication-title: Oper. Res. Lett. – volume: 23 start-page: 703 year: 2015 end-page: 742 ident: b5 article-title: On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed 0-1 problems under uncertainty publication-title: Top – volume: 23 start-page: 3627 year: 2019 end-page: 3641 ident: b23 article-title: Iterated population-based VND algorithms for single-machine scheduling with sequence-dependent setup times publication-title: Soft Comput. – year: 2018 ident: b56 article-title: Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: Development and computational evaluation of a parallel branch-and-price algorithm publication-title: Comput. Oper. Res. (published online) – volume: 52 start-page: 1200 year: 2014 end-page: 1214 ident: b45 article-title: Unrelated parallel machine scheduling with setup times and ready times publication-title: Int. J. Prod. Res. – volume: 79 start-page: 190 year: 2017 end-page: 206 ident: b62 article-title: Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times publication-title: Comput. Oper. Res. – volume: 16 start-page: 14 year: 2013 end-page: 37 ident: b2 article-title: Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking publication-title: Int. J. Oper. Res. – volume: 73 start-page: 1563 year: 2013 end-page: 1577 ident: b21 article-title: Combining multi-core and GPU computing for solving combinatorial optimization problems publication-title: J. Parallel Distrib. Comput. – volume: 56 start-page: 95 year: 2016 end-page: 109 ident: b68 article-title: Parallel branch-and-bound in multi-core multi-CPU multi-GPU heterogeneous environments publication-title: Future Gener. Comput. Syst. – volume: 8 start-page: 1691 year: 2014 end-page: 1698 ident: b39 article-title: A parallel branch and bound algorithm for solving large scale integer programming problems publication-title: Appl. Math. Inf. Sci. – volume: 53 start-page: 895 year: 2002 end-page: 906 ident: b30 article-title: Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times publication-title: J. Oper. Res. Soc. – volume: 29 year: 2017 ident: b34 article-title: IVM-based parallel branch-and-bound using hierarchical work stealing on multi-GPU systems publication-title: Concurr. Comput.: Pract. Exper. – volume: 85 start-page: 87 year: 2017 end-page: 96 ident: b53 article-title: Solving large batches of traveling salesman problems with parallel and distributed computing publication-title: Comput. Oper. Res. – volume: 59 start-page: 85 year: 2016 end-page: 92 ident: b48 article-title: Efficient parallelization using rank convergence in dynamic programming algorithms publication-title: Commun. ACM – volume: 37 start-page: 576 year: 2008 end-page: 588 ident: b4 article-title: Multi-machine earliness and tardiness scheduling problem: an interconnected neural network approach publication-title: Int. J. Adv. Manuf. Technol. – start-page: 1 year: 2022 end-page: 20 ident: b51 article-title: A hybrid VNS-Lagrangean heuristic framework applied on single machine scheduling problem with sequence-dependent setup times, release dates and due dates publication-title: Optim. Lett. – reference: Kumar, S., Misra, A., Tomar, R.S., 2011. A modified parallel approach to Single Source Shortest Path Problem for massively dense graphs using CUDA. In: Proceedings of the 2nd International Conference on Computer and Communication Technology. ICCCT, pp. 635–639. – volume: 246 start-page: 345 year: 2015 end-page: 378 ident: b7 article-title: The third comprehensive survey on scheduling problems with setup times/costs publication-title: European J. Oper. Res. – reference: Amdahl, G.M., 1967. Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of the April 18-20, 1967, Spring Joint Computer Conference. pp. 483–485. – volume: 26 start-page: 127 year: 1999 end-page: 141 ident: b13 article-title: Early/tardy scheduling with sequence dependent setups on uniform parallel machines publication-title: Comput. Oper. Res. – year: 2015 ident: b52 article-title: OpenMP application program interface version 4.5. Retrieved september 12, 2017 – volume: vol. 52 start-page: 189 year: 2009 end-page: 198 ident: b27 article-title: Weighted tardiness scheduling with sequence-dependent setups: A benchmark problem for soft computing publication-title: Applications of Soft Computing: Updating the State of the Art – volume: 40 start-page: 344 year: 2013 end-page: 352 ident: b64 article-title: An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times publication-title: Comput. Oper. Res. – volume: 22 start-page: 85 year: 1995 end-page: 99 ident: b57 article-title: Scheduling in a sequence dependent setup environment with genetic search publication-title: Comput. Oper. Res. – volume: 50 start-page: 47 year: 2014 end-page: 60 ident: b71 article-title: A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times publication-title: Comput. Oper. Res. – volume: 81 start-page: 72 year: 2015 end-page: 84 ident: b20 article-title: Towards a heterogeneous and adaptive parallel branch-and-bound algorithm publication-title: J. Comput. System Sci. – volume: 70 start-page: 839 year: 2010 end-page: 848 ident: b60 article-title: Lock-free parallel dynamic programming publication-title: J. Parallel Distrib. Comput. – volume: 38 start-page: 297 year: 2000 end-page: 305 ident: b72 article-title: Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach publication-title: Comput. Ind. Eng. – volume: 287 start-page: 1 year: 2020 end-page: 18 ident: b58 article-title: Parallel computational optimization in operations research: A new integrative framework, literature review and research directions publication-title: European J. Oper. Res. – volume: 29 start-page: 184 year: 2015 end-page: 195 ident: b36 article-title: An improved scatter search algorithm for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times publication-title: Appl. Soft Comput. – volume: 22 start-page: 269 year: 2009 end-page: 286 ident: b66 article-title: A novel b and b algorithm for a unrelated parallel machine scheduling problem to minimize the total weighted tardiness publication-title: Int. J. Eng. – volume: 17 start-page: 271 year: 2014 end-page: 287 ident: b70 article-title: Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness publication-title: J. Sched. – year: 2003 ident: b26 article-title: Weighted Tardiness Scheduling with Sequence-Dependent Setups: A Benchmark Library – start-page: 475 year: 2003 end-page: 513 ident: b28 article-title: Parallel strategies for meta-heuristics publication-title: Handbook of Metaheuristics – volume: 21 start-page: 777 year: 2010 end-page: 785 ident: b18 article-title: Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups publication-title: J. Intell. Manuf. – volume: 59 start-page: 119 year: 2016 end-page: 139 ident: b33 article-title: A GPU-based branch-and-bound algorithm using integer–Vector–matrix data structure publication-title: Parallel Comput. – volume: 11 start-page: 78 year: 1999 end-page: 94 ident: b24 article-title: Solving parallel machine scheduling problems by column generation publication-title: INFORMS J. Comput. – reference: Tran, Q.N., 2010. Designing efficient many-core parallel algorithms for all-pairs shortest-paths using CUDA. In: Proceedings of the 7th International Conference on Information Technology: New Generations. ITNG, pp. 7–12. – volume: 248 start-page: 25 year: 2017 end-page: 73 ident: b12 article-title: Minimizing value-at-risk in single-machine scheduling publication-title: Ann. Oper. Res. – year: 2008 ident: b38 article-title: OpenMP - Eine Einführung in die parallele Programmierung mit C/C++ – volume: 46 start-page: 316 year: 1998 end-page: 329 ident: b14 article-title: Branch-and-price: Column generation for solving huge integer programs publication-title: Oper. Res. – volume: 187 start-page: 985 year: 2008 end-page: 1032 ident: b9 article-title: A survey of scheduling problems with setup times or costs publication-title: European J. Oper. Res. – year: 2010 ident: b37 article-title: Introduction to High Performance Computing for Scientists and Engineers – volume: 37 start-page: 996 year: 2008 end-page: 1004 ident: b69 article-title: A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem publication-title: Int. J. Adv. Manuf. Technol. – volume: 39 start-page: 42 year: 2012 end-page: 47 ident: b17 article-title: Solving knapsack problems on GPU publication-title: Comput. Oper. Res. – start-page: 1203 year: 2014 end-page: 1212 ident: b49 article-title: A multi-core parallel branch-and-bound algorithm using factorial number system publication-title: Parallel and Distributed Processing Symposium, 2014 IEEE 28th International – reference: Rashid, H., Novoa, C., Qasem, A., 2010. An evaluation of parallel knapsack algorithms on multicore architectures.. In: Proceedings of the 2010 International Conference on Scientific Computing. pp. 230–235. – start-page: 747 year: 2016 end-page: 755 ident: b1 article-title: GPU-based two level parallel B&B for the blocking job shop scheduling problem publication-title: Appl. Soft Comput. – volume: 42 start-page: 1042 year: 1994 end-page: 1066 ident: b32 article-title: Parallel branch-and-branch algorithms: survey and synthesis publication-title: Oper. Res. – volume: 54 start-page: 791 year: 2012 end-page: 812 ident: b59 article-title: A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times publication-title: J. Global Optim. – volume: 73 start-page: 1563 issue: 12 year: 2013 ident: 10.1016/j.cor.2024.106804_b21 article-title: Combining multi-core and GPU computing for solving combinatorial optimization problems publication-title: J. Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2013.07.023 – volume: 29 issue: 9 year: 2017 ident: 10.1016/j.cor.2024.106804_b34 article-title: IVM-based parallel branch-and-bound using hierarchical work stealing on multi-GPU systems publication-title: Concurr. Comput.: Pract. Exper. doi: 10.1002/cpe.4019 – volume: 229 start-page: 212 issue: 1 year: 2013 ident: 10.1016/j.cor.2024.106804_b29 article-title: Parallel computing applied to the stochastic dynamic programming for long term operation planning of hydrothermal power systems publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2013.02.024 – volume: vol. 1 start-page: 331 year: 1977 ident: 10.1016/j.cor.2024.106804_b42 article-title: A “pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness – volume: 29 start-page: 45 issue: 1 year: 1997 ident: 10.1016/j.cor.2024.106804_b43 article-title: A heuristic to minimize the total weighted tardiness with sequence-dependent setups publication-title: IIE Trans. doi: 10.1080/07408179708966311 – volume: 36 start-page: 1900 issue: 6 year: 2009 ident: 10.1016/j.cor.2024.106804_b65 article-title: A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2008.06.007 – volume: 56 start-page: 95 year: 2016 ident: 10.1016/j.cor.2024.106804_b68 article-title: Parallel branch-and-bound in multi-core multi-CPU multi-GPU heterogeneous environments publication-title: Future Gener. Comput. Syst. doi: 10.1016/j.future.2015.10.009 – volume: 248 start-page: 25 year: 2017 ident: 10.1016/j.cor.2024.106804_b12 article-title: Minimizing value-at-risk in single-machine scheduling publication-title: Ann. Oper. Res. doi: 10.1007/s10479-016-2251-z – start-page: 475 year: 2003 ident: 10.1016/j.cor.2024.106804_b28 article-title: Parallel strategies for meta-heuristics – ident: 10.1016/j.cor.2024.106804_b31 doi: 10.1109/IPDPS.2011.354 – year: 2008 ident: 10.1016/j.cor.2024.106804_b38 – ident: 10.1016/j.cor.2024.106804_b55 – volume: 258 start-page: 590 issue: 2 year: 2017 ident: 10.1016/j.cor.2024.106804_b6 article-title: A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2016.08.072 – year: 2010 ident: 10.1016/j.cor.2024.106804_b37 – volume: 53 start-page: 895 issue: 8 year: 2002 ident: 10.1016/j.cor.2024.106804_b30 article-title: Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times publication-title: J. Oper. Res. Soc. doi: 10.1057/palgrave.jors.2601390 – volume: 246 start-page: 345 issue: 2 year: 2015 ident: 10.1016/j.cor.2024.106804_b7 article-title: The third comprehensive survey on scheduling problems with setup times/costs publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2015.04.004 – volume: 11 start-page: 78 issue: 1 year: 1999 ident: 10.1016/j.cor.2024.106804_b24 article-title: Solving parallel machine scheduling problems by column generation publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.11.1.78 – volume: 20 start-page: 261 issue: 2 year: 2009 ident: 10.1016/j.cor.2024.106804_b63 article-title: Improving performance of dynamic programming via parallelism and locality on multicore architectures publication-title: IEEE Trans. Parallel Distrib. Syst. doi: 10.1109/TPDS.2008.78 – volume: 38 start-page: 297 issue: 2 year: 2000 ident: 10.1016/j.cor.2024.106804_b72 article-title: Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach publication-title: Comput. Ind. Eng. doi: 10.1016/S0360-8352(00)00048-6 – volume: 22 start-page: 21 issue: 1 year: 2019 ident: 10.1016/j.cor.2024.106804_b40 article-title: A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems publication-title: J. Sched. doi: 10.1007/s10951-017-0549-6 – volume: 52 start-page: 2729 issue: 9 year: 2014 ident: 10.1016/j.cor.2024.106804_b61 article-title: An iterated local search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2014.883472 – volume: 22 start-page: 85 issue: 1 year: 1995 ident: 10.1016/j.cor.2024.106804_b57 article-title: Scheduling in a sequence dependent setup environment with genetic search publication-title: Comput. Oper. Res. doi: 10.1016/0305-0548(93)E0021-K – volume: 176 start-page: 1508 issue: 3 year: 2007 ident: 10.1016/j.cor.2024.106804_b47 article-title: A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2005.11.001 – volume: 46 start-page: 316 issue: 3 year: 1998 ident: 10.1016/j.cor.2024.106804_b14 article-title: Branch-and-price: Column generation for solving huge integer programs publication-title: Oper. Res. doi: 10.1287/opre.46.3.316 – start-page: 1203 year: 2014 ident: 10.1016/j.cor.2024.106804_b49 article-title: A multi-core parallel branch-and-bound algorithm using factorial number system – volume: vol. 5 start-page: 287 year: 1979 ident: 10.1016/j.cor.2024.106804_b35 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey – volume: 5 start-page: 2 year: 1993 ident: 10.1016/j.cor.2024.106804_b15 article-title: Feature article - reporting computational experiments with parallel algorithms: Issues, measures, and experts’ opinions publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.5.1.2 – volume: 39 start-page: 42 issue: 1 year: 2012 ident: 10.1016/j.cor.2024.106804_b17 article-title: Solving knapsack problems on GPU publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.03.014 – start-page: 747 year: 2016 ident: 10.1016/j.cor.2024.106804_b1 article-title: GPU-based two level parallel B&B for the blocking job shop scheduling problem publication-title: Appl. Soft Comput. – volume: 42 start-page: 186 issue: 2 year: 2014 ident: 10.1016/j.cor.2024.106804_b19 article-title: Using diversification, communication and parallelism to solve mixed-integer linear programs publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2013.12.012 – volume: 187 start-page: 985 issue: 3 year: 2008 ident: 10.1016/j.cor.2024.106804_b9 article-title: A survey of scheduling problems with setup times or costs publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2006.06.060 – volume: 59 start-page: 119 year: 2016 ident: 10.1016/j.cor.2024.106804_b33 article-title: A GPU-based branch-and-bound algorithm using integer–Vector–matrix data structure publication-title: Parallel Comput. doi: 10.1016/j.parco.2016.01.008 – volume: 287 start-page: 1 issue: 1 year: 2020 ident: 10.1016/j.cor.2024.106804_b58 article-title: Parallel computational optimization in operations research: A new integrative framework, literature review and research directions publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2019.11.033 – volume: 42 start-page: 1042 issue: 6 year: 1994 ident: 10.1016/j.cor.2024.106804_b32 article-title: Parallel branch-and-branch algorithms: survey and synthesis publication-title: Oper. Res. doi: 10.1287/opre.42.6.1042 – volume: 29 start-page: 184 year: 2015 ident: 10.1016/j.cor.2024.106804_b36 article-title: An improved scatter search algorithm for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2014.12.030 – volume: 85 start-page: 87 year: 2017 ident: 10.1016/j.cor.2024.106804_b53 article-title: Solving large batches of traveling salesman problems with parallel and distributed computing publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2017.04.001 – volume: 39 start-page: 109 year: 2019 ident: 10.1016/j.cor.2024.106804_b50 article-title: Analysis of mixed integer programming formulations for single machine scheduling problems with sequence dependent setup times and release dates publication-title: Pesquisa Oper. doi: 10.1590/0101-7438.2019.039.01.0109 – year: 2015 ident: 10.1016/j.cor.2024.106804_b52 – start-page: 1 year: 2022 ident: 10.1016/j.cor.2024.106804_b51 article-title: A hybrid VNS-Lagrangean heuristic framework applied on single machine scheduling problem with sequence-dependent setup times, release dates and due dates publication-title: Optim. Lett. – volume: 26 start-page: 127 issue: 2 year: 1999 ident: 10.1016/j.cor.2024.106804_b13 article-title: Early/tardy scheduling with sequence dependent setups on uniform parallel machines publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(98)00051-3 – ident: 10.1016/j.cor.2024.106804_b41 doi: 10.1109/ICCCT.2011.6075214 – volume: 17 start-page: 271 year: 2014 ident: 10.1016/j.cor.2024.106804_b70 article-title: Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness publication-title: J. Sched. doi: 10.1007/s10951-013-0351-z – volume: vol. 52 start-page: 189 year: 2009 ident: 10.1016/j.cor.2024.106804_b27 article-title: Weighted tardiness scheduling with sequence-dependent setups: A benchmark problem for soft computing – volume: 34 start-page: 1899 issue: 7 year: 2007 ident: 10.1016/j.cor.2024.106804_b44 article-title: An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2005.07.020 – volume: 23 start-page: 703 issue: 3 year: 2015 ident: 10.1016/j.cor.2024.106804_b5 article-title: On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed 0-1 problems under uncertainty publication-title: Top doi: 10.1007/s11750-014-0359-3 – volume: 40 start-page: 2387 issue: 10 year: 2013 ident: 10.1016/j.cor.2024.106804_b25 article-title: A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2013.04.009 – volume: 37 start-page: 576 issue: 5 year: 2008 ident: 10.1016/j.cor.2024.106804_b4 article-title: Multi-machine earliness and tardiness scheduling problem: an interconnected neural network approach publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-007-0993-0 – year: 2018 ident: 10.1016/j.cor.2024.106804_b56 article-title: Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: Development and computational evaluation of a parallel branch-and-price algorithm publication-title: Comput. Oper. Res. (published online) – volume: 54 start-page: 791 issue: 4 year: 2012 ident: 10.1016/j.cor.2024.106804_b59 article-title: A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times publication-title: J. Global Optim. doi: 10.1007/s10898-011-9793-z – volume: 25 start-page: 1121 issue: 8, SI year: 2013 ident: 10.1016/j.cor.2024.106804_b22 article-title: Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm publication-title: Concurr. Comput.-Pract. Exp. doi: 10.1002/cpe.2931 – volume: 5 start-page: 44 year: 2008 ident: 10.1016/j.cor.2024.106804_b11 article-title: A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem publication-title: Int. J. Oper. Res. (Taichung) – volume: 79 start-page: 190 year: 2017 ident: 10.1016/j.cor.2024.106804_b62 article-title: Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2016.10.008 – volume: 47 start-page: 862 issue: 6 year: 1999 ident: 10.1016/j.cor.2024.106804_b3 article-title: Parallel machine scheduling by column generation publication-title: Oper. Res. doi: 10.1287/opre.47.6.862 – volume: 28 start-page: 540 issue: 3 year: 2016 ident: 10.1016/j.cor.2024.106804_b16 article-title: Using GPU computing for solving the two-dimensional guillotine cutting problem publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2016.0693 – volume: 70 start-page: 839 issue: 8 year: 2010 ident: 10.1016/j.cor.2024.106804_b60 article-title: Lock-free parallel dynamic programming publication-title: J. Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2010.01.004 – volume: 50 start-page: 47 year: 2014 ident: 10.1016/j.cor.2024.106804_b71 article-title: A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.04.009 – volume: 27 start-page: 219 issue: 2 year: 1999 ident: 10.1016/j.cor.2024.106804_b8 article-title: A review of scheduling research involving setup considerations publication-title: Omega doi: 10.1016/S0305-0483(98)00042-5 – volume: 23 start-page: 3627 issue: 11 year: 2019 ident: 10.1016/j.cor.2024.106804_b23 article-title: Iterated population-based VND algorithms for single-machine scheduling with sequence-dependent setup times publication-title: Soft Comput. doi: 10.1007/s00500-018-3014-3 – volume: 8 start-page: 1691 issue: 4 year: 2014 ident: 10.1016/j.cor.2024.106804_b39 article-title: A parallel branch and bound algorithm for solving large scale integer programming problems publication-title: Appl. Math. Inf. Sci. doi: 10.12785/amis/080425 – ident: 10.1016/j.cor.2024.106804_b67 doi: 10.1109/ITNG.2010.230 – volume: 22 start-page: 269 issue: 3 year: 2009 ident: 10.1016/j.cor.2024.106804_b66 article-title: A novel b and b algorithm for a unrelated parallel machine scheduling problem to minimize the total weighted tardiness publication-title: Int. J. Eng. – volume: 37 start-page: 996 year: 2008 ident: 10.1016/j.cor.2024.106804_b69 article-title: A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem publication-title: Int. J. Adv. Manuf. Technol. doi: 10.1007/s00170-007-1023-y – volume: 21 start-page: 777 issue: 6 year: 2010 ident: 10.1016/j.cor.2024.106804_b18 article-title: Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups publication-title: J. Intell. Manuf. doi: 10.1007/s10845-009-0253-2 – volume: 40 start-page: 344 issue: 1 year: 2013 ident: 10.1016/j.cor.2024.106804_b64 article-title: An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2012.07.004 – start-page: 290 year: 2014 ident: 10.1016/j.cor.2024.106804_b46 article-title: Improving branch-and-price for parallel machine scheduling – year: 2003 ident: 10.1016/j.cor.2024.106804_b26 – volume: 81 start-page: 72 issue: 1 year: 2015 ident: 10.1016/j.cor.2024.106804_b20 article-title: Towards a heterogeneous and adaptive parallel branch-and-bound algorithm publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2014.06.012 – volume: 16 start-page: 14 issue: 1 year: 2013 ident: 10.1016/j.cor.2024.106804_b2 article-title: Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking publication-title: Int. J. Oper. Res. doi: 10.1504/IJOR.2013.050538 – ident: 10.1016/j.cor.2024.106804_b54 – volume: 52 start-page: 1200 issue: 4 year: 2014 ident: 10.1016/j.cor.2024.106804_b45 article-title: Unrelated parallel machine scheduling with setup times and ready times publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2013.848305 – ident: 10.1016/j.cor.2024.106804_b10 doi: 10.1145/1465482.1465560 – volume: 59 start-page: 85 issue: 10 year: 2016 ident: 10.1016/j.cor.2024.106804_b48 article-title: Efficient parallelization using rank convergence in dynamic programming algorithms publication-title: Commun. ACM doi: 10.1145/2983553 |
| SSID | ssj0000721 |
| Score | 2.4579537 |
| Snippet | Scheduling problems occur in a broad range of real-world application fields and have attracted a huge set of research articles. However, there is only little... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 106804 |
| SubjectTerms | Branch-and-price algorithm Dynamic programming Sequence-dependent setup times Shared-memory parallelization Single machine scheduling Weighted tardiness |
| Title | Parallel branch-and-price algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times |
| URI | https://dx.doi.org/10.1016/j.cor.2024.106804 |
| Volume | 173 |
| WOSCitedRecordID | wos001313487100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000721 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FFCE48Aggykt74ES1UuLX2seqKgUOVUWLlJu1a--SVMaxXKeU38D_4Hcysw87SgEBEhcrWmU3Vr7PuzPjmfkIeZUJzZWUmoViyhk8iQGTQilWSDErBeZhxFZsgh8fp_N5djIaffe1MJcVr-v06ipr_ivUMAZgY-nsX8DdLwoD8BlAhyvADtc_Av5EtKiPUu1J1MxYMFGXrMHWQXui-rRql93C9mAwJidGCirMYcWUSlTRwNrILyZcCpZoh_QxeyH4wHAmudJ1I0HjkttdJjbzYrodDHXrZkOz3rdBcPIRF4Zsq0a1LgnPtRvqw9KnjYKdpf6svlo22ZBPM8TIveDLgTNte2p-EGu4TZ8ncqRa3zLAvmlagHth9tij9bJcbYY7gngr3NHX4QxJT6b2C1MQY9uzs9_XrUbKtTPChivOAWLsBxtEMJKkVgN5q_X2Ka6Ly2KibcCT6AbZCXicpWOys__ucP5-OPO5qfDr78O_PzeZhFs_9HMLaMOqObtP7jp3hO5bGj0gI1VPyC1fDTEh9zxs1B0CE3Jno4XlQ_LN041u040OdKNANwp0o5Zu1NGNGrpRTzfa040OdKOObhTpRq_TjRq6UUO3R-Tjm8Ozg7fMCXywIkzijsEBpzLwqLUodCjxdAD3dhoVPE0ED-VU6hCuMxFoEfOZCiJRcKlEwmczzUMlw8dkXK9q9YRQcCRK8Hx0FsgkkqUSQVpKLopYg0dc6GiXTP2fnheu-z2KsFS5T3M8zwGnHHHKLU675HU_pbGtX3735cgjmTvb1dqkOdDu19Oe_tu0Z-T28Gw8J-OuXasX5GZx2S0v2peOnD8AdbbHqw |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parallel+branch-and-price+algorithms+for+the+single+machine+total+weighted+tardiness+scheduling+problem+with+sequence-dependent+setup+times&rft.jtitle=Computers+%26+operations+research&rft.au=Speckenmeyer%2C+Philipp&rft.au=Hilmer%2C+Constanze&rft.au=Rauchecker%2C+Gerhard&rft.au=Schryen%2C+Guido&rft.date=2025-01-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.volume=173&rft_id=info:doi/10.1016%2Fj.cor.2024.106804&rft.externalDocID=S0305054824002764 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |