Talent scheduling with daily working capacity and scene changeover times
This paper investigates a talent scheduling problem that incorporates daily work capacity constraints and the changeover times between consecutive scenes filmed on the same day. The problem inherently integrates three key optimization challenges: talent scheduling, the traveling salesperson problem,...
Uloženo v:
| Vydáno v: | Omega (Oxford) Ročník 138; s. 103439 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.01.2026
|
| Témata: | |
| ISSN: | 0305-0483 |
| 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 | This paper investigates a talent scheduling problem that incorporates daily work capacity constraints and the changeover times between consecutive scenes filmed on the same day. The problem inherently integrates three key optimization challenges: talent scheduling, the traveling salesperson problem, and bin packing. To obtain an optimal solution, we develop two integer linear programming models and a dynamic programming algorithm. Additionally, we introduce a polynomial-time dynamic programming algorithm for the special case where the filming order of all scenes is predetermined. This polynomial-time algorithm is incorporated into a tabu search framework to generate high-quality approximate solutions. Finally, we conduct a computational study to assess the effectiveness and efficiency of all proposed solution approaches. The approach of simplifying the problem structures significantly outperforms other algorithms in solution quality and execution time for large-scale instances.
•Formulate talent scheduling with daily working capacity and scene changeover times.•Propose two integer linear programs.•Design two dynamic programming algorithms.•Design a hybrid algorithm with a dynamic program and tabu search.•Conduct a computational study. |
|---|---|
| AbstractList | This paper investigates a talent scheduling problem that incorporates daily work capacity constraints and the changeover times between consecutive scenes filmed on the same day. The problem inherently integrates three key optimization challenges: talent scheduling, the traveling salesperson problem, and bin packing. To obtain an optimal solution, we develop two integer linear programming models and a dynamic programming algorithm. Additionally, we introduce a polynomial-time dynamic programming algorithm for the special case where the filming order of all scenes is predetermined. This polynomial-time algorithm is incorporated into a tabu search framework to generate high-quality approximate solutions. Finally, we conduct a computational study to assess the effectiveness and efficiency of all proposed solution approaches. The approach of simplifying the problem structures significantly outperforms other algorithms in solution quality and execution time for large-scale instances.
•Formulate talent scheduling with daily working capacity and scene changeover times.•Propose two integer linear programs.•Design two dynamic programming algorithms.•Design a hybrid algorithm with a dynamic program and tabu search.•Conduct a computational study. |
| ArticleNumber | 103439 |
| Author | Lin, Bertrand M.T. Yang, Zhaoqi Tanaka, Shunji |
| Author_xml | – sequence: 1 givenname: Zhaoqi surname: Yang fullname: Yang, Zhaoqi organization: Institute of Information Management, Institute of Hospital and Health Care Administration, National Yang Ming Chiao Tung University, Hsinchu 300093, Taiwan – sequence: 2 givenname: Shunji surname: Tanaka fullname: Tanaka, Shunji organization: Faculty of Environmental, Life, Natural Science and Technology, Okayama University, Okayama 700-8530, Japan – sequence: 3 givenname: Bertrand M.T. orcidid: 0000-0003-0456-296X surname: Lin fullname: Lin, Bertrand M.T. email: bmtlin@nycu.edu.tw organization: Institute of Information Management, Institute of Hospital and Health Care Administration, National Yang Ming Chiao Tung University, Hsinchu 300093, Taiwan |
| BookMark | eNp9kMFOAjEQhnvARECfwEtfYHG63YVy8GCIigmJFzw3s9NZKC5d0q4Q3t5FPHua5M98f_58IzEIbWAhHhRMFKjp427S7nmDkxzysk90oecDMQQNZQaF0bdilNIOAJQBPRTLNTYcOploy-678WEjT77bSoe-OctTG78uEeEByXdnicH1rxxY0hbDhtsjR9n5Pac7cVNjk_j-747F5-vLerHMVh9v74vnVUZ5WXaZ00ZXVVGV4BybGgwwlbOciHBGdW2cMjzlGZCbazMnmkKuiloRmhwr0KjHQl97KbYpRa7tIfo9xrNVYC8C7M7-CrAXAfYqoKeerhT3046eo03kORA7H5k661r_L_8DQdVqhw |
| Cites_doi | 10.1007/978-3-030-90425-8_9 10.1007/978-3-030-19823-7_19 10.1007/BF02078647 10.1007/s00291-007-0103-6 10.1016/j.cie.2013.12.017 10.1287/opre.46.1.1 10.1111/poms.13573 10.1007/BF00940554 10.1006/jagm.2001.1205 10.1016/j.omega.2005.08.002 10.1016/j.omega.2024.103061 10.1287/opre.46.3.S154 10.1016/j.cie.2018.10.028 10.1016/j.omega.2024.103154 10.1287/opre.46.3.S84 10.1016/j.disopt.2011.11.001 10.1051/ro/1987210100651 10.1002/nav.22256 10.1109/ACCESS.2020.2982664 10.1287/ijoc.1.3.190 10.1057/palgrave.jors.2600612 10.1016/j.cie.2011.01.002 10.1007/s10479-014-1531-8 10.1287/ijoc.2.1.4 10.1287/ijoc.1090.0378 10.3934/jimo.2016013 10.1057/jors.1976.12 10.1109/KSE56063.2022.9953796 |
| ContentType | Journal Article |
| Copyright | 2025 Elsevier Ltd |
| Copyright_xml | – notice: 2025 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.omega.2025.103439 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Business |
| ExternalDocumentID | 10_1016_j_omega_2025_103439 S0305048325001653 |
| GroupedDBID | --K --M -~X .~1 0R~ 13V 1B1 1OL 1~. 1~5 29N 4.4 457 4G. 5VS 7-5 71M 8P~ 96U 9DU 9JO AAAKF AAAKG AABNK AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AATTM AAXKI AAXUO AAYWO ABDPE ABJNI ABKBG ABMAC ABMVD ABUCO ABWVN ABXDB ACBMB ACDAQ ACGFS ACHQT ACHRH ACLOT ACNCT ACNTT ACRLP ACRPL ACVFH ADBBV ADCNI ADEZE ADIYS ADMHG ADMUD ADNMO ADVLN AEBSH AEIPS AEKER AENEX AEUPX AFACB AFAZI AFFNX AFJKZ AFPUW AFTJW AGHFR AGQPQ AGQRV AGUBO AGUMN AGYEJ AHEHV AHHHB AHMBA AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALEQD ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU APLSM APXCP ASPBG AVWKF AXJTR AZFZN BAAKF BDEBP BKOJK BKOMP BLXMC BNSAS CS3 DU5 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA HAMUX HVGLF HZ~ IAO IEA IHE IHR IOF IPC IPO ITC J1W KOM LPU LXL LY1 M41 MO0 MS~ N95 O-L O9- OAUVE OHT OZT P-8 P-9 PC. PQQKQ Q38 R2- ROL RPZ SDF SDG SDP SDS SES SEW SPCBC SSB SSD SSL SSZ T5K TAE TAF TN5 U5U WUQ XPP XSW XYO YNT ZRQ ~G- ~HD AAYXX CITATION |
| ID | FETCH-LOGICAL-c255t-d383bb4b50dde8f080ec572ccca7cff8d18e6e70cd9389cc60214f1ca82ab03a3 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001596877300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0483 |
| IngestDate | Sat Nov 29 06:51:27 EST 2025 Sat Nov 29 17:02:52 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Daily capacity Talent scheduling Integer linear program Dynamic programming Changeover time |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c255t-d383bb4b50dde8f080ec572ccca7cff8d18e6e70cd9389cc60214f1ca82ab03a3 |
| ORCID | 0000-0003-0456-296X |
| ParticipantIDs | crossref_primary_10_1016_j_omega_2025_103439 elsevier_sciencedirect_doi_10_1016_j_omega_2025_103439 |
| PublicationCentury | 2000 |
| PublicationDate | January 2026 2026-01-00 |
| PublicationDateYYYYMMDD | 2026-01-01 |
| PublicationDate_xml | – month: 01 year: 2026 text: January 2026 |
| PublicationDecade | 2020 |
| PublicationTitle | Omega (Oxford) |
| PublicationYear | 2026 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Cheng, Diamond, Lin (b14) 1993; 79 Long, Zhao (b25) 2020; 8 Glover (b38) 1989; 1 Kochetov Y. Iterative local search methods for the talent scheduling problem. In: Proceedings of 1st international symposium and 10th balkan conference on operational research. 2011. Bomsdorf, Derigs (b18) 2008; 30 Adelson, Norman, Laporte (b28) 1976; 27 Pinedo (b1) 2009 Hwang, Lin (b34) 2011; 60 Hall, Posner, Potts (b7) 1998; 46 Pakprajum, Jarumaneeroj (b21) 2017 Nemhauser, Trick (b6) 1998; 46 Cheng, Lin, Huang (b16) 2017; 13 Glover (b39) 1990; 2 Hwang, Kovalyov, Lin (b36) 2014; 217 Drexl, Knust (b5) 2007; 35 Tanaka, Lin (b9) 2025; 72 Ranjbar, Kazemi (b22) 2018; 126 de la Banda, Stuckey, Chu (b15) 2011; 23 Hoa TT, Nguyen MA. An Iterated Local Search for the Talent Scheduling Problem with Location Costs. In: Proceedings of 2022 14th international conference on knowledge and systems engineering. KSE, 2022, p. 1–6. Glover, Taillard, de Werra (b40) 1993; 41 Garey, Johnson (b27) 1979 Smith (b30) 2003 Hall, Posner, Potts (b8) 1998; 46 Hsu (b32) 2002; 43 Xu, Xie, Hall (b37) 2025; 3 Kraul, Erhard, Brunner (b4) 2024; 129 Liu K, Löffler S, Hofstedt P. Solving the talent scheduling problem by parallel constraint programming. In: Artificial intelligence applications and innovations: 15th IFIP WG 12.5 international conference. AIAI 2019, Hersonissos, Crete, Greece; 2019, p. 15. Singh E, Pillay N. Ant-based generation constructive hyper-heuristics for the movie scene scheduling problem. In: Proceedings of theory and practice of natural computing: 10th international conference. TPNC 2021, Tsukuba, Japan; 2021, p. 1–6. Lin (b33) 1999; 10 Akbarzadeh, Maenhout (b2) 2024; 126 Sakulsom, Tharmmaphornphilas (b31) 2014; 70 Condotta, Shakhlevich (b3) 2014; 3 Higgins (b11) 1998; 49 Liu, Sun, Zhang, Wu (b24) 2019 Wang, Chuang, Lin (b17) 2016; 33 Hwang, Kovalyov, Lin (b35) 2012; 9 Landry (b12) 2017 Tian, Shi, Qi (b13) 2022; 31 Laporte (b29) 1987; 21 Durán-Micco, van Kooten Niekerk, Vansteenwegen (b10) 1998; 187 Tanaka (10.1016/j.omega.2025.103439_b9) 2025; 72 Tian (10.1016/j.omega.2025.103439_b13) 2022; 31 Sakulsom (10.1016/j.omega.2025.103439_b31) 2014; 70 Liu (10.1016/j.omega.2025.103439_b24) 2019 Higgins (10.1016/j.omega.2025.103439_b11) 1998; 49 de la Banda (10.1016/j.omega.2025.103439_b15) 2011; 23 10.1016/j.omega.2025.103439_b19 Pinedo (10.1016/j.omega.2025.103439_b1) 2009 Xu (10.1016/j.omega.2025.103439_b37) 2025; 3 Cheng (10.1016/j.omega.2025.103439_b14) 1993; 79 Bomsdorf (10.1016/j.omega.2025.103439_b18) 2008; 30 Wang (10.1016/j.omega.2025.103439_b17) 2016; 33 Akbarzadeh (10.1016/j.omega.2025.103439_b2) 2024; 126 Glover (10.1016/j.omega.2025.103439_b40) 1993; 41 Hall (10.1016/j.omega.2025.103439_b8) 1998; 46 Pakprajum (10.1016/j.omega.2025.103439_b21) 2017 Nemhauser (10.1016/j.omega.2025.103439_b6) 1998; 46 Condotta (10.1016/j.omega.2025.103439_b3) 2014; 3 Smith (10.1016/j.omega.2025.103439_b30) 2003 Garey (10.1016/j.omega.2025.103439_b27) 1979 Glover (10.1016/j.omega.2025.103439_b39) 1990; 2 Laporte (10.1016/j.omega.2025.103439_b29) 1987; 21 Drexl (10.1016/j.omega.2025.103439_b5) 2007; 35 Hsu (10.1016/j.omega.2025.103439_b32) 2002; 43 Glover (10.1016/j.omega.2025.103439_b38) 1989; 1 Landry (10.1016/j.omega.2025.103439_b12) 2017 Hwang (10.1016/j.omega.2025.103439_b35) 2012; 9 Cheng (10.1016/j.omega.2025.103439_b16) 2017; 13 Adelson (10.1016/j.omega.2025.103439_b28) 1976; 27 Hwang (10.1016/j.omega.2025.103439_b34) 2011; 60 Kraul (10.1016/j.omega.2025.103439_b4) 2024; 129 10.1016/j.omega.2025.103439_b26 Hall (10.1016/j.omega.2025.103439_b7) 1998; 46 Ranjbar (10.1016/j.omega.2025.103439_b22) 2018; 126 10.1016/j.omega.2025.103439_b23 Long (10.1016/j.omega.2025.103439_b25) 2020; 8 Hwang (10.1016/j.omega.2025.103439_b36) 2014; 217 Durán-Micco (10.1016/j.omega.2025.103439_b10) 1998; 187 10.1016/j.omega.2025.103439_b20 Lin (10.1016/j.omega.2025.103439_b33) 1999; 10 |
| References_xml | – reference: Liu K, Löffler S, Hofstedt P. Solving the talent scheduling problem by parallel constraint programming. In: Artificial intelligence applications and innovations: 15th IFIP WG 12.5 international conference. AIAI 2019, Hersonissos, Crete, Greece; 2019, p. 15. – volume: 21 start-page: 65 year: 1987 end-page: 85 ident: b29 article-title: Solving a family of permutation problems on 0-1 matrices publication-title: RAIRO: Oper Res – volume: 46 start-page: S84 year: 1998 end-page: S97 ident: b8 article-title: Scheduling with finite capacity output buffers publication-title: Oper Res – volume: 27 start-page: 119 year: 1976 end-page: 121 ident: b28 article-title: A dynamic programming formulation with diverse applications publication-title: Oper Res Q – year: 2009 ident: b1 article-title: Planning and scheduling in manufacturing and services – volume: 31 start-page: 697 year: 2022 end-page: 714 ident: b13 article-title: Stochastic sequential allocations for creative crowdsourcing publication-title: Prod Oper Manage – volume: 129 year: 2024 ident: b4 article-title: Optimizing physician schedules with resilient break assignments publication-title: Omega – volume: 79 start-page: 479 year: 1993 end-page: 492 ident: b14 article-title: Optimal scheduling in film production to minimize talent hold cost publication-title: J Optim Theory Appl – volume: 3 start-page: 129 year: 2014 end-page: 144 ident: b3 article-title: Scheduling patient appointments via multilevel template: A case study in chemotherapy publication-title: Oper Res Heal Care – volume: 33 start-page: 17 year: 2016 end-page: 31 ident: b17 article-title: Minimizing talent cost and operating cost in film production publication-title: J Ind Prod Eng – volume: 10 start-page: 101 year: 1999 end-page: 110 ident: b33 article-title: A new branch-and-bound algorithm for the film production problem publication-title: J Ming Chuan Coll – volume: 46 start-page: S154 year: 1998 end-page: S159 ident: b7 article-title: Scheduling with finite capacity input buffers publication-title: Oper Res – reference: Singh E, Pillay N. Ant-based generation constructive hyper-heuristics for the movie scene scheduling problem. In: Proceedings of theory and practice of natural computing: 10th international conference. TPNC 2021, Tsukuba, Japan; 2021, p. 1–6. – volume: 9 start-page: 29 year: 2012 end-page: 39 ident: b35 article-title: Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence publication-title: Discrete Optim – year: 1979 ident: b27 article-title: Computers and intractability: A guide to the theory of NP-completeness – year: 2003 ident: b30 article-title: Constraint programming in practice: Scheduling a rehearsal – year: 2019 ident: b24 article-title: Research on the scheduling problem of movie scenes publication-title: Discrete Dyn Nat Soc – volume: 43 start-page: 1 year: 2002 end-page: 16 ident: b32 article-title: A simple test for the consecutive ones property publication-title: J Algorithms – year: 2017 ident: b12 article-title: Scheduling and budgeting your film: A panic-free guide – volume: 13 start-page: 223 year: 2017 end-page: 235 ident: b16 article-title: Talent hold cost minimization in film production publication-title: J Ind Manag Optim – volume: 70 start-page: 20 year: 2014 end-page: 30 ident: b31 article-title: Scheduling a music rehearsal problem with unequal music piece length publication-title: Comput Ind Eng – volume: 8 start-page: 59091 year: 2020 end-page: 59099 ident: b25 article-title: Scheduling problem of movie scenes based on three meta-heuristic algorithms publication-title: IEEE Access – volume: 49 start-page: 1026 year: 1998 end-page: 1033 ident: b11 article-title: Scheduling of railway track maintenance activities and crews publication-title: J Oper Res Soc – reference: Kochetov Y. Iterative local search methods for the talent scheduling problem. In: Proceedings of 1st international symposium and 10th balkan conference on operational research. 2011. – volume: 187 year: 1998 ident: b10 article-title: Designing bus line plans for realistic cases-the Utrecht case study publication-title: Expert Syst Appl – reference: Hoa TT, Nguyen MA. An Iterated Local Search for the Talent Scheduling Problem with Location Costs. In: Proceedings of 2022 14th international conference on knowledge and systems engineering. KSE, 2022, p. 1–6. – volume: 3 start-page: 415 year: 2025 end-page: 420 ident: b37 article-title: Sequencing with learning, forgetting and task similarity publication-title: Work Pap – volume: 60 start-page: 690 year: 2011 end-page: 698 ident: b34 article-title: Coupled-task scheduling on a single machine subject to a fixed job-sequence publication-title: Comput Ind Eng – volume: 1 start-page: 190 year: 1989 end-page: 206 ident: b38 article-title: Tabu search - Part I publication-title: ORSA J Comput – volume: 41 start-page: 3 year: 1993 end-page: 28 ident: b40 article-title: A user’s guide to tabu search publication-title: Ann Oper Res – volume: 46 start-page: 1 year: 1998 end-page: 8 ident: b6 article-title: Scheduling a major college basketball conference publication-title: Oper Res – volume: 126 start-page: 673 year: 2018 end-page: 680 ident: b22 article-title: A generalized variable neighborhood search algorithm for the talent scheduling problem publication-title: Comput Ind Eng – volume: 23 start-page: 120 year: 2011 end-page: 137 ident: b15 article-title: Solving talent scheduling with dynamic programming publication-title: INFORMS J Comput – volume: 72 start-page: 810 year: 2025 end-page: 824 ident: b9 article-title: Single-machine scheduling to minimize the size of input buffer publication-title: Naval Res Logist – volume: 2 start-page: 4 year: 1990 end-page: 32 ident: b39 article-title: Tabu search - Part II publication-title: ORSA J Comput – volume: 126 year: 2024 ident: b2 article-title: A study on policy decisions to embed flexibility for reactive recovery in the planning and scheduling process in operating rooms publication-title: Omega – volume: 217 start-page: 263 year: 2014 end-page: 279 ident: b36 article-title: Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence publication-title: Ann Oper Res – volume: 35 start-page: 465 year: 2007 end-page: 471 ident: b5 article-title: Sports league scheduling: Graph- and resource-based models publication-title: Omega – volume: 30 start-page: 751 year: 2008 end-page: 772 ident: b18 article-title: A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem publication-title: OR Spectrum – year: 2017 ident: b21 article-title: An integrated MILP for music rehearsal problems with waiting time publication-title: Proceedings of 2017 4th international conference on industrial engineering and applications – ident: 10.1016/j.omega.2025.103439_b20 doi: 10.1007/978-3-030-90425-8_9 – ident: 10.1016/j.omega.2025.103439_b23 doi: 10.1007/978-3-030-19823-7_19 – year: 2003 ident: 10.1016/j.omega.2025.103439_b30 – volume: 41 start-page: 3 year: 1993 ident: 10.1016/j.omega.2025.103439_b40 article-title: A user’s guide to tabu search publication-title: Ann Oper Res doi: 10.1007/BF02078647 – volume: 30 start-page: 751 year: 2008 ident: 10.1016/j.omega.2025.103439_b18 article-title: A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem publication-title: OR Spectrum doi: 10.1007/s00291-007-0103-6 – volume: 3 start-page: 415 issue: 6 year: 2025 ident: 10.1016/j.omega.2025.103439_b37 article-title: Sequencing with learning, forgetting and task similarity publication-title: Work Pap – year: 2019 ident: 10.1016/j.omega.2025.103439_b24 article-title: Research on the scheduling problem of movie scenes publication-title: Discrete Dyn Nat Soc – volume: 70 start-page: 20 year: 2014 ident: 10.1016/j.omega.2025.103439_b31 article-title: Scheduling a music rehearsal problem with unequal music piece length publication-title: Comput Ind Eng doi: 10.1016/j.cie.2013.12.017 – volume: 46 start-page: 1 year: 1998 ident: 10.1016/j.omega.2025.103439_b6 article-title: Scheduling a major college basketball conference publication-title: Oper Res doi: 10.1287/opre.46.1.1 – volume: 31 start-page: 697 issue: 2 year: 2022 ident: 10.1016/j.omega.2025.103439_b13 article-title: Stochastic sequential allocations for creative crowdsourcing publication-title: Prod Oper Manage doi: 10.1111/poms.13573 – volume: 79 start-page: 479 issue: 3 year: 1993 ident: 10.1016/j.omega.2025.103439_b14 article-title: Optimal scheduling in film production to minimize talent hold cost publication-title: J Optim Theory Appl doi: 10.1007/BF00940554 – volume: 43 start-page: 1 year: 2002 ident: 10.1016/j.omega.2025.103439_b32 article-title: A simple test for the consecutive ones property publication-title: J Algorithms doi: 10.1006/jagm.2001.1205 – volume: 35 start-page: 465 year: 2007 ident: 10.1016/j.omega.2025.103439_b5 article-title: Sports league scheduling: Graph- and resource-based models publication-title: Omega doi: 10.1016/j.omega.2005.08.002 – volume: 126 year: 2024 ident: 10.1016/j.omega.2025.103439_b2 article-title: A study on policy decisions to embed flexibility for reactive recovery in the planning and scheduling process in operating rooms publication-title: Omega doi: 10.1016/j.omega.2024.103061 – volume: 46 start-page: S154 year: 1998 ident: 10.1016/j.omega.2025.103439_b7 article-title: Scheduling with finite capacity input buffers publication-title: Oper Res doi: 10.1287/opre.46.3.S154 – volume: 126 start-page: 673 year: 2018 ident: 10.1016/j.omega.2025.103439_b22 article-title: A generalized variable neighborhood search algorithm for the talent scheduling problem publication-title: Comput Ind Eng doi: 10.1016/j.cie.2018.10.028 – volume: 129 year: 2024 ident: 10.1016/j.omega.2025.103439_b4 article-title: Optimizing physician schedules with resilient break assignments publication-title: Omega doi: 10.1016/j.omega.2024.103154 – volume: 46 start-page: S84 year: 1998 ident: 10.1016/j.omega.2025.103439_b8 article-title: Scheduling with finite capacity output buffers publication-title: Oper Res doi: 10.1287/opre.46.3.S84 – year: 2017 ident: 10.1016/j.omega.2025.103439_b12 – year: 2009 ident: 10.1016/j.omega.2025.103439_b1 – year: 2017 ident: 10.1016/j.omega.2025.103439_b21 article-title: An integrated MILP for music rehearsal problems with waiting time – volume: 3 start-page: 129 year: 2014 ident: 10.1016/j.omega.2025.103439_b3 article-title: Scheduling patient appointments via multilevel template: A case study in chemotherapy publication-title: Oper Res Heal Care – ident: 10.1016/j.omega.2025.103439_b19 – year: 1979 ident: 10.1016/j.omega.2025.103439_b27 – volume: 9 start-page: 29 issue: 1 year: 2012 ident: 10.1016/j.omega.2025.103439_b35 article-title: Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence publication-title: Discrete Optim doi: 10.1016/j.disopt.2011.11.001 – volume: 33 start-page: 17 issue: 1 year: 2016 ident: 10.1016/j.omega.2025.103439_b17 article-title: Minimizing talent cost and operating cost in film production publication-title: J Ind Prod Eng – volume: 21 start-page: 65 year: 1987 ident: 10.1016/j.omega.2025.103439_b29 article-title: Solving a family of permutation problems on 0-1 matrices publication-title: RAIRO: Oper Res doi: 10.1051/ro/1987210100651 – volume: 72 start-page: 810 year: 2025 ident: 10.1016/j.omega.2025.103439_b9 article-title: Single-machine scheduling to minimize the size of input buffer publication-title: Naval Res Logist doi: 10.1002/nav.22256 – volume: 8 start-page: 59091 year: 2020 ident: 10.1016/j.omega.2025.103439_b25 article-title: Scheduling problem of movie scenes based on three meta-heuristic algorithms publication-title: IEEE Access doi: 10.1109/ACCESS.2020.2982664 – volume: 1 start-page: 190 issue: 3 year: 1989 ident: 10.1016/j.omega.2025.103439_b38 article-title: Tabu search - Part I publication-title: ORSA J Comput doi: 10.1287/ijoc.1.3.190 – volume: 187 year: 1998 ident: 10.1016/j.omega.2025.103439_b10 article-title: Designing bus line plans for realistic cases-the Utrecht case study publication-title: Expert Syst Appl – volume: 49 start-page: 1026 year: 1998 ident: 10.1016/j.omega.2025.103439_b11 article-title: Scheduling of railway track maintenance activities and crews publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2600612 – volume: 60 start-page: 690 issue: 4 year: 2011 ident: 10.1016/j.omega.2025.103439_b34 article-title: Coupled-task scheduling on a single machine subject to a fixed job-sequence publication-title: Comput Ind Eng doi: 10.1016/j.cie.2011.01.002 – volume: 217 start-page: 263 year: 2014 ident: 10.1016/j.omega.2025.103439_b36 article-title: Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence publication-title: Ann Oper Res doi: 10.1007/s10479-014-1531-8 – volume: 2 start-page: 4 issue: 1 year: 1990 ident: 10.1016/j.omega.2025.103439_b39 article-title: Tabu search - Part II publication-title: ORSA J Comput doi: 10.1287/ijoc.2.1.4 – volume: 23 start-page: 120 issue: 1 year: 2011 ident: 10.1016/j.omega.2025.103439_b15 article-title: Solving talent scheduling with dynamic programming publication-title: INFORMS J Comput doi: 10.1287/ijoc.1090.0378 – volume: 13 start-page: 223 issue: 1 year: 2017 ident: 10.1016/j.omega.2025.103439_b16 article-title: Talent hold cost minimization in film production publication-title: J Ind Manag Optim doi: 10.3934/jimo.2016013 – volume: 27 start-page: 119 issue: 1 year: 1976 ident: 10.1016/j.omega.2025.103439_b28 article-title: A dynamic programming formulation with diverse applications publication-title: Oper Res Q doi: 10.1057/jors.1976.12 – volume: 10 start-page: 101 year: 1999 ident: 10.1016/j.omega.2025.103439_b33 article-title: A new branch-and-bound algorithm for the film production problem publication-title: J Ming Chuan Coll – ident: 10.1016/j.omega.2025.103439_b26 doi: 10.1109/KSE56063.2022.9953796 |
| SSID | ssj0001803 |
| Score | 2.466729 |
| Snippet | This paper investigates a talent scheduling problem that incorporates daily work capacity constraints and the changeover times between consecutive scenes... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 103439 |
| SubjectTerms | Changeover time Daily capacity Dynamic programming Integer linear program Talent scheduling |
| Title | Talent scheduling with daily working capacity and scene changeover times |
| URI | https://dx.doi.org/10.1016/j.omega.2025.103439 |
| Volume | 138 |
| WOSCitedRecordID | wos001596877300001&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-0483 databaseCode: AIEXJ dateStart: 19950201 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0001803 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bT9swFLZYO017mQZsgo1NftgbpMrNifNYoaKCUJm0IhVeIufEAQpLWWm3_nyOL0m6FVXwsJeoslLX8uf6fOfTuRDyDS1wFMjQcxKe5E7IwHV46GUOhyxkMnEZCJ0ofBoPBnw0Sr7bdkcPup1AXJZ8sUju_yvUOIZgq9TZF8BdT4oD-BlBxyfCjs_nAS-UIdlHrxWtyF2tteZCCRl_jDa-D2gjQRFwrZsDXng2BVhFdC41nLe09eynvBK6MunCBMPX8sGF1Zsvr8Xk102jA5TiVtPSH9fzclyPn9ru8HI6m-oIj86ws6w7-Mu6g823UmF_oWlDU9-lplSLvQ09NwhNqaKVi9poBuPORK0f3XSfdZq3_y6L_Y-5qoMIq_i0caonSdUkqZnkFWn7MUt4i7S7x73RSW2bPe6ahtl27VUdKh3xt7KWp7nKEv8YvifvrONAuwbwTbIhyy3ypspb2CZ9gzttcKcKd6pxpxZ3WuFOcfepxp02uFON-wdyftQbHvYd2ybDAfQHZ04e8CDLwoy5aKp4gS6ABBb7gP_NGIqC5x6XkYxdyBNkpwCRKpNXeCC4LzI3EMFH0ionpdwhNJYsyiGJMq9wVdVKrthxwXgm8xAk47vkoNqQ9N5UQ0nXwLBLomrTUkvoDFFL8Ris--Knl_3OZ_K2OaF7pDWbzuUX8hp-z24epl_tGXgELGlrrA |
| 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=Talent+scheduling+with+daily+working+capacity+and+scene+changeover+times&rft.jtitle=Omega+%28Oxford%29&rft.au=Yang%2C+Zhaoqi&rft.au=Tanaka%2C+Shunji&rft.au=Lin%2C+Bertrand+M.T.&rft.date=2026-01-01&rft.issn=0305-0483&rft.volume=138&rft.spage=103439&rft_id=info:doi/10.1016%2Fj.omega.2025.103439&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_omega_2025_103439 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0483&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0483&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0483&client=summon |