Scheduling with day shifts and breaks
Traditional scheduling assumes that production can continue around the clock unless machines are not available. This is not without question for labor‐intensive industries where operations are performed manually. Motivated by operation management problems arising in the assembly stage of aeroengines...
Uloženo v:
| Vydáno v: | International transactions in operational research Ročník 28; číslo 2; s. 598 - 614 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Oxford
Blackwell Publishing Ltd
01.03.2021
|
| Témata: | |
| ISSN: | 0969-6016, 1475-3995 |
| 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 | Traditional scheduling assumes that production can continue around the clock unless machines are not available. This is not without question for labor‐intensive industries where operations are performed manually. Motivated by operation management problems arising in the assembly stage of aeroengines and in the paint‐spraying stage of wooden furniture, we consider a scheduling problem with day shifts and breaks. We transform the problem into a new bin‐packing problem and present some theoretical analyses. To meet the needs of practical applications, we propose a binary integer programming (BIP) formulation and a hybrid genetic algorithm (HGA) that is based on five heuristic algorithms and two postoptimization procedures. Computational results indicate that the BIP formulation is suitable for some data sets while the HGA is the most promising in that it saves about 37% of day shifts compared to the best of the five heuristic algorithms in the context of scheduling. |
|---|---|
| AbstractList | Traditional scheduling assumes that production can continue around the clock unless machines are not available. This is not without question for labor‐intensive industries where operations are performed manually. Motivated by operation management problems arising in the assembly stage of aeroengines and in the paint‐spraying stage of wooden furniture, we consider a scheduling problem with day shifts and breaks. We transform the problem into a new bin‐packing problem and present some theoretical analyses. To meet the needs of practical applications, we propose a binary integer programming (BIP) formulation and a hybrid genetic algorithm (HGA) that is based on five heuristic algorithms and two postoptimization procedures. Computational results indicate that the BIP formulation is suitable for some data sets while the HGA is the most promising in that it saves about 37% of day shifts compared to the best of the five heuristic algorithms in the context of scheduling. Traditional scheduling assumes that production can continue around the clock unless machines are not available. This is not without question for labor‐intensive industries where operations are performed manually. Motivated by operation management problems arising in the assembly stage of aeroengines and in the paint‐spraying stage of wooden furniture, we consider a scheduling problem with day shifts and breaks. We transform the problem into a new bin‐packing problem and present some theoretical analyses. To meet the needs of practical applications, we propose a binary integer programming (BIP) formulation and a hybrid genetic algorithm (HGA) that is based on five heuristic algorithms and two postoptimization procedures. Computational results indicate that the BIP formulation is suitable for some data sets while the HGA is the most promising in that it saves about 37% of day shifts compared to the best of the five heuristic algorithms in the context of scheduling. |
| Author | Yu, Xianyu Xu, Dehua Xu, Limin |
| Author_xml | – sequence: 1 givenname: Dehua orcidid: 0000-0002-9704-9868 surname: Xu fullname: Xu, Dehua email: xudehua@nufe.edu.cn organization: Nanjing University of Finance & Economics – sequence: 2 givenname: Limin surname: Xu fullname: Xu, Limin email: xulimin@nufe.edu.cn organization: Nanjing University of Finance & Economics – sequence: 3 givenname: Xianyu surname: Yu fullname: Yu, Xianyu email: xyyu@nuaa.edu.cn organization: Nanjing University of Aeronautics and Astronautics |
| BookMark | eNp9kEtLAzEUhYNUsK1u_AUD4kaYmpuZJJ2lFB-FQkHrOuRpU8eZmqSU_nunjisR7-Zsvu9cOCM0aNrGInQJeALd3frUhgmQKaUnaAglp3lRVXSAhrhiVc4wsDM0inGDMQYKfIiuX_Taml3tm7ds79M6M_KQxbV3KWayMZkKVr7Hc3TqZB3txU-O0evD_Wr2lC-Wj_PZ3SLXRdeXU8UqSUrLmZba8ZKRyoJ2yoABbEBjwhUwShRXkoJl2tGpVlISx7UyXBZjdNX3bkP7ubMxiU27C033UpCSAuUlsKKjcE_p0MYYrBPaJ5l826QgfS0Ai-MY4jiG-B6jU25-KdvgP2Q4_A1DD-99bQ__kGK-Wj73zhf3HHGL |
| CitedBy_id | crossref_primary_10_1111_itor_70085 |
| Cites_doi | 10.3390/a12120247 10.1016/j.cie.2018.06.025 10.1111/itor.12393 10.1057/palgrave.jors.2601998 10.1016/j.cie.2008.03.005 10.1016/S0305-0548(02)00074-6 10.1016/j.omega.2008.01.001 10.1016/j.knosys.2017.12.021 10.1111/itor.12302 10.1007/s00170-006-0689-x 10.1111/itor.12662 10.1051/ro/2018055 10.1111/itor.12645 10.1007/s00170-005-0253-0 10.1007/s10951-017-0543-z 10.1016/j.asoc.2017.05.058 10.1016/j.cor.2005.05.034 10.1016/j.omega.2017.05.004 10.1007/s10589-019-00142-5 10.1002/nav.21901 10.1007/978-3-642-24488-9 10.1080/03155986.2016.1166795 10.1007/s13369-017-2763-0 10.1016/j.ijpe.2017.01.014 10.1016/j.cor.2018.10.010 10.1080/00207543.2018.1489160 10.1016/j.ejor.2018.05.050 10.1016/j.cie.2018.01.028 10.1111/itor.12719 10.1016/j.promfg.2020.01.147 10.1051/ro/2018062 10.1016/j.omega.2016.06.008 |
| ContentType | Journal Article |
| Copyright | 2020 The Authors. International Transactions in Operational Research © 2020 International Federation of Operational Research Societies 2021 The Authors. |
| Copyright_xml | – notice: 2020 The Authors. International Transactions in Operational Research © 2020 International Federation of Operational Research Societies – notice: 2021 The Authors. |
| DBID | AAYXX CITATION 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D |
| DOI | 10.1111/itor.12855 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | CrossRef Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1475-3995 |
| EndPage | 614 |
| ExternalDocumentID | 10_1111_itor_12855 ITOR12855 |
| Genre | article |
| GrantInformation_xml | – fundername: Qinglan Project of Universities in Jiangsu – fundername: National Natural Science Foundation of China funderid: 71774080 |
| GroupedDBID | --K .3N .GA .Y3 05W 0R~ 10A 1B1 1OC 1XV 29J 31~ 33P 4.4 50Y 50Z 51W 51Y 52M 52O 52Q 52S 52T 52U 52W 5GY 5HH 5LA 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 8VB 930 A04 AABNI AAEDT AAESR AAHHS AAHQN AALRI AAMNL AANHP AAONW AAOUF AAQFI AAQXK AASGY AAXRX AAXUO AAYCA AAZKR ABCQN ABCUV ABEML ABJNI ABPVW ABSOO ABWVN ACAHQ ACBKW ACBWZ ACCFJ ACCZN ACGFS ACHQT ACIWK ACPOU ACRPL ACSCC ACXQS ACYXJ ADBBV ADEMA ADEOM ADIZJ ADKYN ADMGS ADMUD ADNMO ADXAS ADZMN ADZOD AEEZP AEIGN AEIMD AEMOZ AENEX AEQDE AEUQT AEUYR AFBPY AFEBI AFFPM AFGKR AFKFF AFPWT AFWVQ AFYRF AFZJQ AHBTC AHQJS AIFKG AIURR AIWBW AJBDE AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ASPBG ASTYK AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BMXJE BNVMJ BQESF BROTX BRXPI BY8 CAG COF CS3 D-C D-D DCZOG DPXWK DR2 DRFUL DRSSH DU5 EBA EBO EBR EBS EBU EJD EMK F00 F01 F5P FDB FEDTE FGOYB FIRID G-S G.N G50 GODZA HGLYW HVGLF HZI HZ~ I-F IHE IX1 J0M K1G K48 LATKE LC2 LC4 LEEKS LG8 LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES M41 MEWTI MK4 MRFUL MRSSH MSFUL MSSSH MXFUL MXSSH N04 N06 N9A NF~ NQ- O66 O9- OIG P2P P2W P2Y P4C PQQKQ Q.N Q11 QB0 QWB R.K R2- RIG ROL RPZ RX1 SEW SUPJJ TH9 UB1 UHS W8V W99 WBKPD WEBCB WIH WII WOHZO WQZ WRC WSUWO WXSBR XG1 ZL0 ZZTAW ~IA ~WP 9DU AAMMB AAYXX ACVFH ADCNI AEFGJ AEUPX AEYWJ AFPUW AGHNM AGQPQ AGXDD AIDQK AIDYY AMVHM CITATION O8X 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c3015-5b69a24e76cacf74629e1cfbd1d10d1c027b1652b7ba51e6cf58cbaa2f7cbd7a3 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000556251500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0969-6016 |
| IngestDate | Sun Nov 30 04:43:16 EST 2025 Tue Nov 18 21:07:10 EST 2025 Sat Nov 29 06:31:36 EST 2025 Wed Jan 22 16:59:53 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3015-5b69a24e76cacf74629e1cfbd1d10d1c027b1652b7ba51e6cf58cbaa2f7cbd7a3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-9704-9868 |
| PQID | 2451574163 |
| PQPubID | 45259 |
| PageCount | 17 |
| ParticipantIDs | proquest_journals_2451574163 crossref_citationtrail_10_1111_itor_12855 crossref_primary_10_1111_itor_12855 wiley_primary_10_1111_itor_12855_ITOR12855 |
| PublicationCentury | 2000 |
| PublicationDate | March 2021 2021-03-00 20210301 |
| PublicationDateYYYYMMDD | 2021-03-01 |
| PublicationDate_xml | – month: 03 year: 2021 text: March 2021 |
| PublicationDecade | 2020 |
| PublicationPlace | Oxford |
| PublicationPlace_xml | – name: Oxford |
| PublicationTitle | International transactions in operational research |
| PublicationYear | 2021 |
| Publisher | Blackwell Publishing Ltd |
| Publisher_xml | – name: Blackwell Publishing Ltd |
| References | 2018; 144 2019a; 53 2012 2006; 57 2019; 57 2019; 12 2018; 123 2017; 24 2017; 68 2016; 54 1997 2019; 38 2019; 103 1973 2008; 55 2018; 21 2018; 43 2007; 34 2003; 30 1979 2018; 271 2018; 117 2020; 75 2017; 59 2019; 26 2007a; 34 2020; 27 2019 2019b; 53 2020; 67 2017; 186 2018; 76 2007b; 31 2009; 37 e_1_2_9_30_1 e_1_2_9_31_1 e_1_2_9_34_1 e_1_2_9_10_1 e_1_2_9_35_1 e_1_2_9_13_1 e_1_2_9_32_1 e_1_2_9_33_1 Coffman E.G. (e_1_2_9_11_1) 1997 Garey M.R. (e_1_2_9_14_1) 1979 e_1_2_9_15_1 e_1_2_9_17_1 e_1_2_9_36_1 e_1_2_9_16_1 e_1_2_9_37_1 e_1_2_9_19_1 e_1_2_9_18_1 Siqueira E.C. (e_1_2_9_12_1) 2020; 27 e_1_2_9_20_1 e_1_2_9_22_1 e_1_2_9_21_1 e_1_2_9_24_1 e_1_2_9_23_1 e_1_2_9_8_1 e_1_2_9_7_1 e_1_2_9_6_1 e_1_2_9_5_1 e_1_2_9_4_1 e_1_2_9_3_1 e_1_2_9_2_1 e_1_2_9_9_1 e_1_2_9_26_1 e_1_2_9_25_1 Parsa N.R. (e_1_2_9_29_1) 2019 e_1_2_9_28_1 e_1_2_9_27_1 |
| References_xml | – volume: 117 start-page: 138 year: 2018 end-page: 151 article-title: Two‐machine job shop problem under availability constraints on one machine: makespan minimization publication-title: Computers & Industrial Engineering – year: 2019 article-title: Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating publication-title: International Transactions in Operational Research – volume: 271 start-page: 826 year: 2018 end-page: 838 article-title: A branch‐and‐price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine publication-title: European Journal of Operational Research – volume: 27 start-page: 1368 year: 2020 end-page: 1391 article-title: A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem publication-title: International Transactions in Operational Research – volume: 34 start-page: 1173 year: 2007a end-page: 1182 article-title: An efficient algorithm for scheduling jobs on a machine with periodic maintenance publication-title: International Journal of Advanced Manufacturing Technology – year: 2019 article-title: A hybrid neural network approach to minimize total completion time on a single batch processing machine publication-title: International Transactions in Operational Research – volume: 26 start-page: 1956 year: 2019 end-page: 1976 article-title: Multitasking scheduling with multiple rate‐modifying activities publication-title: International Transactions in Operational Research – year: 1973 – volume: 57 start-page: 1427 year: 2019 end-page: 1457 article-title: Minimising the makespan in the two‐machine job shop problem under availability constraints publication-title: International Journal of Production Research – volume: 68 start-page: 119 year: 2017 end-page: 122 article-title: On single‐machine scheduling with workload‐dependent maintenance duration publication-title: Omega – volume: 53 start-page: 289 year: 2019a end-page: 302 article-title: A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance publication-title: RAIRO Operations Research – volume: 38 start-page: 1409 year: 2019 end-page: 1416 article-title: Minimizing the number of tardy jobs on identical parallel machines subject to periodic maintenance publication-title: Procedia Manufacturing – volume: 30 start-page: 1335 year: 2003 end-page: 1347 article-title: Single‐machine scheduling with periodic maintenance and nonresumable jobs publication-title: Computers & Operations Research – year: 1979 – volume: 57 start-page: 410 year: 2006 end-page: 415 article-title: Minimizing total flow time in the single‐machine scheduling problem with periodic maintenance publication-title: Journal of the Operational Research Society – volume: 123 start-page: 180 year: 2018 end-page: 188 article-title: Single machine scheduling with periodic machine availability publication-title: Computers & Industrial Engineering – volume: 103 start-page: 46 year: 2019 end-page: 63 article-title: A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence‐dependent setup times, machine eligibility restrictions and a common server publication-title: Computers & Operations Research – year: 2012 – volume: 75 start-page: 291 year: 2020 end-page: 320 article-title: Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance publication-title: Computational Optimization and Applications – volume: 27 start-page: 614 year: 2020 end-page: 650 article-title: An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem publication-title: International Transactions in Operational Research – volume: 55 start-page: 830 year: 2008 end-page: 840 article-title: Single‐machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness publication-title: Computers & Industrial Engineering – volume: 76 start-page: 128 year: 2018 end-page: 136 article-title: Two machine scheduling subject to arbitrary machine availability constraint publication-title: Omega – volume: 34 start-page: 1764 year: 2007 end-page: 1770 article-title: Single‐machine scheduling with periodic maintenance to minimize makespan publication-title: Computers & Operations Research – volume: 54 start-page: 305 year: 2016 end-page: 316 article-title: Makespan minimization for parallel machine scheduling of semi‐resumable and non‐resumable jobs with multiple availability constraints publication-title: INFOR: Information Systems and Operational Research – volume: 37 start-page: 591 year: 2009 end-page: 599 article-title: Minimizing number of tardy jobs on a single machine subject to periodic maintenance publication-title: Omega – volume: 12 start-page: 247 year: 2019 article-title: Modeling and solving scheduling problem with uniform parallel machines subject to unavailability constraints publication-title: Algorithms – volume: 186 start-page: 1 year: 2017 end-page: 7 article-title: Parallel‐machine scheduling with machine‐dependent maintenance periodic recycles publication-title: International Journal of Production Economics – volume: 67 start-page: 272 year: 2020 end-page: 288 article-title: Efficient algorithms for flexible job shop scheduling with parallel machines publication-title: Naval Research Logistics – volume: 59 start-page: 556 year: 2017 end-page: 573 article-title: A hybridization of genetic algorithms and fuzzy logic for the single‐machine scheduling with flexible maintenance problem under human resource constraints publication-title: Applied Soft Computing – volume: 53 start-page: 351 year: 2019b end-page: 365 article-title: Two‐machine flow shop with synchronized periodic maintenance publication-title: RAIRO Operations Research – volume: 31 start-page: 737 year: 2007b end-page: 742 article-title: Scheduling of jobs and maintenance in a textile company publication-title: International Journal of Advanced Manufacturing Technology – start-page: 46 year: 1997 end-page: 93 article-title: Approximation algorithms for bin packing: a survey – volume: 43 start-page: 777 year: 2018 end-page: 788 article-title: Mixed integer programming formulations for two‐machine flow shop scheduling with an availability constraint publication-title: Arabian Journal for Science and Engineering – volume: 144 start-page: 32 year: 2018 end-page: 41 article-title: An uncertain single machine scheduling problem with periodic maintenance publication-title: Knowledge‐Based Systems – volume: 24 year: 2017 article-title: Heuristics for the two‐machine scheduling problem with a single server publication-title: International Transactions in Operational Research – volume: 21 start-page: 461 year: 2018 end-page: 482 article-title: Single‐machine scheduling with workload‐dependent tool change durations and equal processing time jobs to minimize total completion time publication-title: Journal of Scheduling – ident: e_1_2_9_19_1 doi: 10.3390/a12120247 – ident: e_1_2_9_30_1 doi: 10.1016/j.cie.2018.06.025 – ident: e_1_2_9_37_1 doi: 10.1111/itor.12393 – ident: e_1_2_9_7_1 doi: 10.1057/palgrave.jors.2601998 – ident: e_1_2_9_31_1 doi: 10.1016/j.cie.2008.03.005 – volume-title: Computers and Intractability: A Guide to the Theory of NP‐Completeness year: 1979 ident: e_1_2_9_14_1 – ident: e_1_2_9_26_1 doi: 10.1016/S0305-0548(02)00074-6 – ident: e_1_2_9_10_1 doi: 10.1016/j.omega.2008.01.001 – ident: e_1_2_9_32_1 doi: 10.1016/j.knosys.2017.12.021 – ident: e_1_2_9_2_1 doi: 10.1111/itor.12302 – ident: e_1_2_9_8_1 doi: 10.1007/s00170-006-0689-x – volume: 27 start-page: 614 year: 2020 ident: e_1_2_9_12_1 article-title: An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem publication-title: International Transactions in Operational Research doi: 10.1111/itor.12662 – ident: e_1_2_9_22_1 doi: 10.1051/ro/2018055 – ident: e_1_2_9_15_1 doi: 10.1111/itor.12645 – year: 2019 ident: e_1_2_9_29_1 article-title: A hybrid neural network approach to minimize total completion time on a single batch processing machine publication-title: International Transactions in Operational Research – ident: e_1_2_9_9_1 doi: 10.1007/s00170-005-0253-0 – ident: e_1_2_9_35_1 doi: 10.1007/s10951-017-0543-z – ident: e_1_2_9_33_1 doi: 10.1016/j.asoc.2017.05.058 – ident: e_1_2_9_17_1 doi: 10.1016/j.cor.2005.05.034 – ident: e_1_2_9_16_1 doi: 10.1016/j.omega.2017.05.004 – ident: e_1_2_9_21_1 doi: 10.1007/s10589-019-00142-5 – ident: e_1_2_9_24_1 doi: 10.1002/nav.21901 – ident: e_1_2_9_20_1 doi: 10.1007/978-3-642-24488-9 – ident: e_1_2_9_3_1 doi: 10.1080/03155986.2016.1166795 – ident: e_1_2_9_36_1 doi: 10.1007/s13369-017-2763-0 – ident: e_1_2_9_25_1 doi: 10.1016/j.ijpe.2017.01.014 – ident: e_1_2_9_4_1 doi: 10.1016/j.cor.2018.10.010 – ident: e_1_2_9_6_1 doi: 10.1080/00207543.2018.1489160 – ident: e_1_2_9_34_1 doi: 10.1016/j.ejor.2018.05.050 – ident: e_1_2_9_18_1 – ident: e_1_2_9_5_1 doi: 10.1016/j.cie.2018.01.028 – start-page: 46 volume-title: Approximation Algorithms for NP‐Hard Problems year: 1997 ident: e_1_2_9_11_1 – ident: e_1_2_9_13_1 doi: 10.1111/itor.12719 – ident: e_1_2_9_28_1 doi: 10.1016/j.promfg.2020.01.147 – ident: e_1_2_9_23_1 doi: 10.1051/ro/2018062 – ident: e_1_2_9_27_1 doi: 10.1016/j.omega.2016.06.008 |
| SSID | ssj0001517 |
| Score | 2.1832502 |
| Snippet | Traditional scheduling assumes that production can continue around the clock unless machines are not available. This is not without question for... |
| SourceID | proquest crossref wiley |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 598 |
| SubjectTerms | Algorithms bin packing day shift Genetic algorithms heuristic algorithm Integer programming noon break Operations research Production scheduling Scheduling Spraying |
| Title | Scheduling with day shifts and breaks |
| URI | https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fitor.12855 https://www.proquest.com/docview/2451574163 |
| Volume | 28 |
| WOSCitedRecordID | wos000556251500001&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: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1475-3995 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001517 issn: 0969-6016 databaseCode: DRFUL dateStart: 19970101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB5qK6IHH1WxWmVBPShEums22wUvohYFqVJb6C3sK1qUKE0V_PfubpO2ggjiLYdJCDPzzWOZ_QbgwPbIIW8qGUjDqW1QpAps3jFBpBoiZE1OCdN-2QRrt5v9Pr8vwVlxF2bMDzE5cHPI8PHaAVzIbAbk1uGHJza6UjoHFWIdl5ahctlp9W4nkdhmM39dmkc8cLQjOT2pm-SZvv09IU2rzNla1Seb1sr_fnMVlvMiE52PvWINSiatwkIx416FlWKXA8qhXYWlGWLCdTh8sLbUbkj9EbmTWqTFJ8qeBskoQyLVyPbR4jnbgF7rqntxHeQLFQJlcUwDKiMuSGhYpIRKWBgRbrBKpMYaNzRWtkWVOKJEMikoNpFKqDWjECRhSmomTjehnL6mZguQwEQYQhSR2vYYwuK4gRNKuNA8EVjqGhwVWo1Vzjbull68xEXX4RQTe8XUYH8i-zbm2PhRql4YJ85xlsUktPWYLyprcOzN8MsX4pvuXcc_bf9FeAcWiRtk8YNndSiPhu9mF-bVx2iQDfdyn_sChMPaNQ |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60FR8Hq1WxWjWgHhQi3TWbdI-ilhZrldpCb2Ff0aJUaargv3d3u2kriCDecpiEMDPfPJbZbwCOdI8c0KrgPleU6AaFC1_nHeWHosKCqEoJjqRdNhG1WtVej9672RxzF2bMDzE5cDPIsPHaANwcSM-gXHv88EyHV0LmIR9oP9IOnr9q17rNSSjW6czel6Yh9Q3viOMnNaM807e_Z6RpmTlbrNpsUyv88z_XYNWVmd7F2C_WYU4NirCYTbkXoZBtc_AcuIuwMkNNuAHHD9qa0oypP3rmrNaT7NNLn_rJKPXYQHq6k2bP6SZ0a9edy7rvVir4QiOZ-ISHlOFARaFgIomCEFOFRMIlkqgikdBNKkchwTzijCAVioRoQzKGk0hwGbHzLcgNXgdqGzyGMFMYC8yl7jKYRnIFJQRTJmnCEJclOMnUGgvHN27WXrzEWd9hFBNbxZTgcCL7NmbZ-FGqnFkndkhLYxzoisyWlSU4tXb45Qtxo3PXtk87fxE-gKV657YZNxutm11YxmasxY6hlSE3Gr6rPVgQH6N-Otx3DvgFnMPeJQ |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60StGD1apYrRpQDwqR7ppNukexBoulltpCb2Ff0aLE0lTBf-_uNmkriCDecpiEMDPfPJbZbwBOdY_s0brgLleU6AaFC1fnHeX6osa8oE4JDqRdNhG02_XBgHay2RxzF2bKDzE7cDPIsPHaAFyNZLyAcu3x40sdXglZhhXPbJEpwEqjG_Zbs1Cs05m9L0196hrekYyf1IzyzN_-npHmZeZisWqzTVj6539uwkZWZjrXU7_YgiWVlKGYT7mXoZRvc3AycJdhfYGacBvOHrU1pRlTf3LMWa0j2aeTPg_jSeqwRDq6k2Yv6Q70w9vezZ2brVRwhUYycQn3KcOeCnzBRBx4PqYKiZhLJFFNIqGbVI58gnnAGUHKFzHRhmQMx4HgMmBXu1BI3hK1Bw5DmCmMBeZSdxlMI7mGYoIpkzRmiMsKnOdqjUTGN27WXrxGed9hFBNZxVTgZCY7mrJs_ChVza0TZUhLI-zpisyWlRW4sHb45QtRs_fQtU_7fxE-hmKnEUatZvv-ANawmWqxU2hVKEzG7-oQVsXHZJiOjzL_-wJZu92g |
| 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=Scheduling+with+day+shifts+and+breaks&rft.jtitle=International+transactions+in+operational+research&rft.au=Xu%2C+Dehua&rft.au=Xu%2C+Limin&rft.au=Yu%2C+Xianyu&rft.date=2021-03-01&rft.issn=0969-6016&rft.eissn=1475-3995&rft.volume=28&rft.issue=2&rft.spage=598&rft.epage=614&rft_id=info:doi/10.1111%2Fitor.12855&rft.externalDBID=10.1111%252Fitor.12855&rft.externalDocID=ITOR12855 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0969-6016&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0969-6016&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0969-6016&client=summon |