Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
We study a set of scheduling problems in a distributed flow‐shop scheduling system consisting of several flow‐shop production systems (factories) working in parallel. Our objective is to assign the jobs to the factories, and to devise a job schedule for each of the factories such that the weighted n...
Uloženo v:
| Vydáno v: | Naval research logistics Ročník 70; číslo 3; s. 274 - 283 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Hoboken, USA
John Wiley & Sons, Inc
01.04.2023
Wiley Subscription Services, Inc |
| Témata: | |
| ISSN: | 0894-069X, 1520-6750 |
| 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 | We study a set of scheduling problems in a distributed flow‐shop scheduling system consisting of several flow‐shop production systems (factories) working in parallel. Our objective is to assign the jobs to the factories, and to devise a job schedule for each of the factories such that the weighted number of jobs completed in just‐in‐time mode is maximized. We classify computational complexity of the problems, including the special cases of unit weights and job‐ or machine‐independent processing times. |
|---|---|
| AbstractList | We study a set of scheduling problems in a distributed flow‐shop scheduling system consisting of several flow‐shop production systems (factories) working in parallel. Our objective is to assign the jobs to the factories, and to devise a job schedule for each of the factories such that the weighted number of jobs completed in just‐in‐time mode is maximized. We classify computational complexity of the problems, including the special cases of unit weights and job‐ or machine‐independent processing times. |
| Author | Shabtay, Dvir |
| Author_xml | – sequence: 1 givenname: Dvir orcidid: 0000-0002-2709-599X surname: Shabtay fullname: Shabtay, Dvir email: dvirs@bgu.ac.il organization: Ben‐Gurion University of the Negev |
| BookMark | eNp9kE1OwzAQhS0EEuVnwQ0isWIRmDhNHC8rxJ9UYAOIXeQkk8ZVYhfboZQVR-AInKVH4SS4lBUSbGYW8703T2-HbCqtkJCDCI4jAHqixPMxpcDZBhlECYUwZQlskgFkfBhCyh-3yY61UwBIh5AMSHMtXmQnX6WaBK7BYI5y0jisAtV3BZpA18G0t-7z7V0qP5zsMJjqwgZSLT_E8qOS1hlZ9CtJ3eq5Z2yjZ4EtG6z6dmVrF9Zht0e2atFa3P_Zu-T-_Ozu9DIc315cnY7GYUk5YyFngJDFomJIU4Y-ZFqkiKyMqiqrOaSMI2ZJzLlIWFZyqCEZlv6WIK2LOot3yeHad2b0U4_W5VPdG-Vf5pRlw5imURZ76mhNlUZba7DOZ0Z2wizyCPJVkbkvMv8u0rMnv9hSOuGkVs4I2f6nmMsWF39b5zejh7XiC8ILjMc |
| CitedBy_id | crossref_primary_10_1016_j_eswa_2024_123278 crossref_primary_10_1109_ACCESS_2025_3570362 |
| Cites_doi | 10.1007/s10951-008-0062-z 10.1016/j.ejor.2006.03.068 10.1002/nav.22076 10.1080/00207543.2018.1449978 10.1016/0166-218X(93)E0174-W 10.1057/palgrave.jors.2601512 10.1016/j.ijpe.2011.09.011 10.1016/j.ejor.2011.07.053 10.1007/s10951-013-0320-6 10.1080/00207543.2014.948578 10.1007/s10951-019-00617-7 10.1080/01605682.2019.1578628 10.1007/s10951-010-0204-y 10.1080/00207543.2012.755345 10.7737/JKORMS.2012.37.1.019 10.1016/0166-218X(87)90037-0 10.1287/opre.38.1.22 10.1016/j.ejor.2005.09.030 10.1016/S0925-5273(03)00113-0 10.1002/9781118466421 10.1016/S0377-2217(99)00432-4 10.1007/s10951-007-0030-z 10.1016/j.cor.2009.06.019 10.1016/j.ipl.2014.09.004 10.3390/a11040043 10.1016/j.cor.2003.08.002 10.1080/0953728031000154264 10.1016/S0167-5060(08)70356-X 10.1016/j.ejor.2003.09.010 10.1016/0305-0548(95)00078-X 10.1057/jors.2015.95 10.1007/s12597-020-00484-3 10.1016/j.ejor.2014.05.024 10.1007/s10951-017-0511-7 10.1002/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y |
| ContentType | Journal Article |
| Copyright | 2023 The Author. published by Wiley Periodicals LLC. 2023. This article is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2023 The Author. published by Wiley Periodicals LLC. – notice: 2023. This article is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | 24P AAYXX CITATION 7SC 7TB 7TN 8FD F1W FR3 H96 JQ2 KR7 L.G L7M L~C L~D |
| DOI | 10.1002/nav.22097 |
| DatabaseName | Wiley Online Library Open Access CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Oceanic Abstracts Technology Research Database ASFA: Aquatic Sciences and Fisheries Abstracts Engineering Research Database Aquatic Science & Fisheries Abstracts (ASFA) 2: Ocean Technology, Policy & Non-Living Resources ProQuest Computer Science Collection Civil Engineering Abstracts Aquatic Science & Fisheries Abstracts (ASFA) Professional Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Civil Engineering Abstracts Aquatic Science & Fisheries Abstracts (ASFA) Professional Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Computer and Information Systems Abstracts Professional Aquatic Science & Fisheries Abstracts (ASFA) 2: Ocean Technology, Policy & Non-Living Resources Oceanic Abstracts ASFA: Aquatic Sciences and Fisheries Abstracts Engineering Research Database Advanced Technologies Database with Aerospace |
| DatabaseTitleList | Civil Engineering Abstracts CrossRef |
| Database_xml | – sequence: 1 dbid: 24P name: Wiley Online Library Open Access url: https://authorservices.wiley.com/open-science/open-access/browse-journals.html sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Military & Naval Science |
| EISSN | 1520-6750 |
| EndPage | 283 |
| ExternalDocumentID | 10_1002_nav_22097 NAV22097 |
| Genre | researchArticle |
| GroupedDBID | --Z -~X .3N .GA .Y3 05W 0R~ 10A 123 186 1L6 1OB 1OC 1OL 1ZS 24P 31~ 33P 3SF 3WU 4.4 4ZD 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5VS 66C 6TJ 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHQN AAMMB AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABEML ABIJN ACAHQ ACBWZ ACCZN ACGFS ACIWK ACNCT ACPOU ACRPL ACSCC ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADNMO ADOZA ADXAS ADXHL ADZMN AEFGJ AEIGN AEIMD AEMOZ AENEX AEUYR AEYWJ AFBPY AFFNX AFFPM AFGKR AFWVQ AFZJQ AGHNM AGQPQ AGXDD AGYGG AHBTC AHQJS AIDQK AIDYY AIQQE AITYG AIURR AJXKR AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ATUGU AUFTA AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BNHUX BROTX BRXPI BY8 CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM EBA EBR EBS EBU EJD F00 F01 F04 FEDTE FSPIC G-S G.N GNP GODZA H.T H.X HBH HF~ HGLYW HHY HVGLF HZ~ H~9 IX1 J0M JPC KQQ LATKE LAW LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES M6L MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ NNB O66 O9- P2P P2W P2X P4D PALCI PQQKQ Q.N Q11 QB0 QRW R.K RIWAO RJQFR ROL RX1 SAMSI SUPJJ TH9 TN5 UB1 V2E W8V W99 WBKPD WH7 WIB WIH WIK WOHZO WQJ WXSBR WYISQ XBAML XG1 XPP XV2 ZY4 ZZTAW ~IA ~WT AAYXX CITATION O8X 7SC 7TB 7TN 8FD F1W FR3 H96 JQ2 KR7 L.G L7M L~C L~D |
| ID | FETCH-LOGICAL-c2977-970e083ad7e267e6406b6ee7c1dd8f90679ee85399a578c90f054cdd85e2fbf83 |
| IEDL.DBID | 24P |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000911178700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0894-069X |
| IngestDate | Fri Jul 25 12:27:08 EDT 2025 Tue Nov 18 20:59:37 EST 2025 Sat Nov 29 02:13:00 EST 2025 Sun Sep 21 06:27:18 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| License | Attribution-NonCommercial-NoDerivs |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2977-970e083ad7e267e6406b6ee7c1dd8f90679ee85399a578c90f054cdd85e2fbf83 |
| Notes | History Accepted by Marc Posner, project management and scheduling. ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-2709-599X |
| OpenAccessLink | https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fnav.22097 |
| PQID | 2784326183 |
| PQPubID | 1016414 |
| PageCount | 10 |
| ParticipantIDs | proquest_journals_2784326183 crossref_primary_10_1002_nav_22097 crossref_citationtrail_10_1002_nav_22097 wiley_primary_10_1002_nav_22097_NAV22097 |
| PublicationCentury | 2000 |
| PublicationDate | April 2023 2023-04-00 20230401 |
| PublicationDateYYYYMMDD | 2023-04-01 |
| PublicationDate_xml | – month: 04 year: 2023 text: April 2023 |
| PublicationDecade | 2020 |
| PublicationPlace | Hoboken, USA |
| PublicationPlace_xml | – name: Hoboken, USA – name: New York |
| PublicationTitle | Naval research logistics |
| PublicationYear | 2023 |
| Publisher | John Wiley & Sons, Inc Wiley Subscription Services, Inc |
| Publisher_xml | – name: John Wiley & Sons, Inc – name: Wiley Subscription Services, Inc |
| References | 2014; 239 2017; 20 2010; 37 2012 1990; 38 1995; 59 2015; 53 2019; 57 2009 2003; 14 2022; 69 2008; 11 2012; 37 2012; 15 2021; 72 2007; 10 2008; 187 1987; 18 2003; 54 2021; 58 2005; 161 2013; 16 2001; 130 2015; 115 2019; 22 2013; 51 2007; 176 1979; 5 2005; 32 1998; 1 2012; 136 2018; 11 2003; 85 2012; 216 1996; 23 2016; 67 e_1_2_7_6_1 e_1_2_7_5_1 e_1_2_7_4_1 e_1_2_7_3_1 e_1_2_7_9_1 e_1_2_7_8_1 e_1_2_7_7_1 e_1_2_7_19_1 e_1_2_7_18_1 e_1_2_7_17_1 e_1_2_7_16_1 e_1_2_7_2_1 e_1_2_7_15_1 e_1_2_7_14_1 e_1_2_7_13_1 e_1_2_7_12_1 e_1_2_7_11_1 e_1_2_7_10_1 e_1_2_7_26_1 e_1_2_7_27_1 e_1_2_7_28_1 e_1_2_7_29_1 Sevastyanov S. V. (e_1_2_7_31_1) 2009 e_1_2_7_30_1 e_1_2_7_25_1 e_1_2_7_24_1 e_1_2_7_32_1 e_1_2_7_23_1 e_1_2_7_33_1 e_1_2_7_22_1 e_1_2_7_34_1 e_1_2_7_21_1 e_1_2_7_35_1 e_1_2_7_20_1 e_1_2_7_36_1 e_1_2_7_37_1 |
| References_xml | – volume: 58 start-page: 425 year: 2021 end-page: 447 article-title: Distributed permutation flowshop scheduling problem with total completion time objective publication-title: Opsearch – volume: 161 start-page: 285 year: 2005 end-page: 291 article-title: A note on flow shop and job shop batch scheduling with identical processing time jobs publication-title: European Journal of Operational Research – year: 2009 – volume: 18 start-page: 1 year: 1987 end-page: 8 article-title: Scheduling jobs with fixed start and finish times publication-title: Discrete Applied Mathematics – volume: 53 start-page: 1111 year: 2015 end-page: 1123 article-title: A bounded‐search iterated greedy algorithm for the distributed permutation flowshop scheduling problem publication-title: International Journal of Production Research – volume: 5 start-page: 287 year: 1979 end-page: 326 article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey publication-title: Annals of Discrete Mathematics – volume: 85 start-page: 251 issue: 2 year: 2003 end-page: 262 article-title: Production planning of a multisite manufacturing system by hybrid modelling: A case study from the automotive industry publication-title: International Journal of Production Economics – volume: 72 start-page: 1762 issue: 8 year: 2021 end-page: 1779 article-title: Multi‐scenario scheduling to maximise the weighted number of just‐In‐time jobs publication-title: Journal of the Operational Research Society – volume: 216 start-page: 521 issue: 3 year: 2012 end-page: 532 article-title: The just‐in‐time scheduling problem in a flow‐shop scheduling system publication-title: European Journal of Operational Research – volume: 187 start-page: 1282 year: 2008 end-page: 1292 article-title: Open shop batch scheduling with identical jobs publication-title: European Journal of Operational Research – volume: 10 start-page: 237 year: 2007 end-page: 243 article-title: Maximizing the weighted number of just‐in‐time jobs in flow‐shop scheduling publication-title: Journal of Scheduling – volume: 239 start-page: 323 year: 2014 end-page: 334 article-title: A scatter search algorithm for the distributed permutation Flowshop scheduling problem publication-title: European Journal of Operational Research – volume: 11 start-page: 43 issue: 4 year: 2018 article-title: Near‐optimal heuristics for just‐In‐time jobs maximization in flow shop scheduling publication-title: Algorithms – volume: 23 start-page: 765 year: 1996 end-page: 781 article-title: Single machine scheduling to minimize the number of early and tardy jobs publication-title: Computers and Operations Research – volume: 20 start-page: 313 year: 2017 end-page: 335 article-title: Two‐agent flowshop scheduling to maximize the weighted number of just‐in‐time jobs publication-title: Journal of Scheduling – volume: 38 start-page: 22 year: 1990 end-page: 36 article-title: Sequencing with earliness and tardiness penalties: A review publication-title: Operations Research – volume: 57 start-page: 4854 issue: 15–16 year: 2019 end-page: 4879 article-title: Scheduling in cloud manufacturing: State‐of‐the‐art and research challenges publication-title: International Journal of Production Research – year: 2012 – volume: 32 start-page: 537 issue: 3 year: 2005 end-page: 555 article-title: A Lagrangean‐based heuristic for multi‐plant, multi‐item, multi‐period capacitated lot‐sizing problems with inter‐plant transfers publication-title: Computers and Operations Research – volume: 16 start-page: 429 issue: 4 year: 2013 end-page: 435 article-title: An improved FPTAS for maximizing the weighted number of just‐in‐time jobs in a two‐machine flow shop problem publication-title: Journal of Scheduling – volume: 1 start-page: 157 year: 1998 end-page: 168 article-title: Minimizing total weighted completion time in a proportionate flow shop publication-title: Journal of Scheduling – volume: 130 start-page: 638 year: 2001 end-page: 652 article-title: Minimax earliness‐tardiness costs with unit processing time jobs publication-title: European Journal of Operational Research – volume: 136 start-page: 67 issue: 1 year: 2012 end-page: 74 article-title: A bicriteria approach to maximize the weighted number of just‐in‐time jobs and to minimize the total resource consumption cost in a two‐machine flow‐shop scheduling system publication-title: International Journal of Production Economics – volume: 22 start-page: 663 year: 2019 end-page: 676 article-title: On the parameterized tractability of the just‐in‐time flow‐shop scheduling problem publication-title: Journal of Scheduling – volume: 67 start-page: 752 issue: 5 year: 2016 end-page: 776 article-title: Proportionate flow‐shop scheduling with rejection publication-title: Journal of the Operational Research Society – volume: 176 start-page: 964 issue: 2 year: 2007 end-page: 974 article-title: Minimizing maximum completion times in a proportionate flow‐shop with one machine of different speed publication-title: European Journal of Operational Research – volume: 115 start-page: 159 issue: 2 year: 2015 end-page: 162 article-title: A note: Maximizing the weighted number of just‐In‐time jobs on a proportionate flowshop publication-title: Information Processing Letters – volume: 59 start-page: 225 year: 1995 end-page: 235 article-title: On the ‐coloring of intervals publication-title: Discrete Applied Mathematics – volume: 15 start-page: 39 issue: 1 year: 2012 end-page: 47 article-title: Maximizing the weighted number of just‐in‐time jobs in several two‐machine scheduling systems publication-title: Journal of Scheduling – volume: 14 start-page: 425 issue: 5 year: 2003 end-page: 436 article-title: Multi‐site aggregate production planning with multiple objectives: A goal programming approach publication-title: Production Planning and Control – volume: 51 start-page: 2571 year: 2013 end-page: 2577 article-title: Optimisation approaches for distributed scheduling problems publication-title: International Journal of Production Research – volume: 69 start-page: 1124 issue: 8 year: 2022 end-page: 1137 article-title: Maximizing total early work in a distributed two‐machine flow‐shop publication-title: Naval Research Logistics – volume: 37 start-page: 19 year: 2012 end-page: 28 article-title: Just‐In‐time scheduling with multiple competing agents publication-title: Journal of the Korean Operations Research and Management Science Society – volume: 54 start-page: 437 year: 2003 end-page: 441 article-title: Scheduling unit processing time jobs on an ‐machine flow shop publication-title: Journal of the Operational Research Society – volume: 37 start-page: 754 issue: 4 year: 2010 end-page: 768 article-title: The distributed permutation Flowshop scheduling problem publication-title: Computers and Operations Research – volume: 11 start-page: 433 year: 2008 end-page: 447 article-title: Proportionate flow shop games publication-title: Journal of Scheduling – ident: e_1_2_7_12_1 doi: 10.1007/s10951-008-0062-z – ident: e_1_2_7_26_1 doi: 10.1016/j.ejor.2006.03.068 – ident: e_1_2_7_10_1 doi: 10.1002/nav.22076 – ident: e_1_2_7_23_1 doi: 10.1080/00207543.2018.1449978 – ident: e_1_2_7_5_1 doi: 10.1016/0166-218X(93)E0174-W – ident: e_1_2_7_24_1 doi: 10.1057/palgrave.jors.2601512 – ident: e_1_2_7_34_1 doi: 10.1016/j.ijpe.2011.09.011 – ident: e_1_2_7_32_1 doi: 10.1016/j.ejor.2011.07.053 – ident: e_1_2_7_11_1 doi: 10.1007/s10951-013-0320-6 – ident: e_1_2_7_13_1 doi: 10.1080/00207543.2014.948578 – ident: e_1_2_7_19_1 doi: 10.1007/s10951-019-00617-7 – volume-title: Proceedings of the 9th workshop on models and algorithms for planning and scheduling problems (MAPSP 2009) year: 2009 ident: e_1_2_7_31_1 – ident: e_1_2_7_16_1 doi: 10.1080/01605682.2019.1578628 – ident: e_1_2_7_33_1 doi: 10.1007/s10951-010-0204-y – ident: e_1_2_7_6_1 doi: 10.1080/00207543.2012.755345 – ident: e_1_2_7_9_1 doi: 10.7737/JKORMS.2012.37.1.019 – ident: e_1_2_7_3_1 doi: 10.1016/0166-218X(87)90037-0 – ident: e_1_2_7_4_1 doi: 10.1287/opre.38.1.22 – ident: e_1_2_7_7_1 doi: 10.1016/j.ejor.2005.09.030 – ident: e_1_2_7_17_1 doi: 10.1016/S0925-5273(03)00113-0 – ident: e_1_2_7_20_1 doi: 10.1002/9781118466421 – ident: e_1_2_7_27_1 doi: 10.1016/S0377-2217(99)00432-4 – ident: e_1_2_7_8_1 doi: 10.1007/s10951-007-0030-z – ident: e_1_2_7_28_1 doi: 10.1016/j.cor.2009.06.019 – ident: e_1_2_7_15_1 doi: 10.1016/j.ipl.2014.09.004 – ident: e_1_2_7_14_1 doi: 10.3390/a11040043 – ident: e_1_2_7_30_1 doi: 10.1016/j.cor.2003.08.002 – ident: e_1_2_7_22_1 doi: 10.1080/0953728031000154264 – ident: e_1_2_7_18_1 doi: 10.1016/S0167-5060(08)70356-X – ident: e_1_2_7_25_1 doi: 10.1016/j.ejor.2003.09.010 – ident: e_1_2_7_21_1 doi: 10.1016/0305-0548(95)00078-X – ident: e_1_2_7_35_1 doi: 10.1057/jors.2015.95 – ident: e_1_2_7_2_1 doi: 10.1007/s12597-020-00484-3 – ident: e_1_2_7_29_1 doi: 10.1016/j.ejor.2014.05.024 – ident: e_1_2_7_37_1 doi: 10.1007/s10951-017-0511-7 – ident: e_1_2_7_36_1 doi: 10.1002/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y |
| SSID | ssj0006405 |
| Score | 2.3463247 |
| Snippet | We study a set of scheduling problems in a distributed flow‐shop scheduling system consisting of several flow‐shop production systems (factories) working in... |
| SourceID | proquest crossref wiley |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 274 |
| SubjectTerms | distributed flow‐shop Factories hardness Just in time just‐in‐time scheduling pseudo‐polynomial time algorithm Scheduling |
| Title | Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system |
| URI | https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fnav.22097 https://www.proquest.com/docview/2784326183 |
| Volume | 70 |
| WOSCitedRecordID | wos000911178700001&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: 1520-6750 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006405 issn: 0894-069X databaseCode: DRFUL dateStart: 19960101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3LSsQwFL34WrjxLb4JIuKm2sYxTXAl6uBCBxGV2ZU0SbGi7TCd8bXyE_wEv8VP8Uu8STujgoLgphR605bk3tyT1zkAa8wPBXqC8YSQOEBBTO4Jw5XHDVNUYYLz3er55XHYaPBmU5wOwG7vLEzJD9GfcLOR4fprG-AyLra-kIbKu01KfREOwnAQbHOr20Brp_1umNXK_Yvcct8y0ezRCvl0q1_0ezL6RJhfcapLNPXxf_3iBIxV-JLslQ4xCQMmm4K5E8fF3X4k66Qh0bdIFdLTcHUiH9Lb9AkzGEEsSO7dVKnRpJQKIXlCrrtF5_35Jc3wYqXoyXUeFyTN3l7l26u2xLtWMwuLJDf5PdoUV3mL4KAZk5g9605KsugZuKgfnu8feZX6gqeosOu6oW8Qn0kdGspCg9XJYmZMqAKteSLsBJQx3BLbSox6JfwE0Z_CZzuGJnHCt2dhKMszMwdEMy2SIAziWCQ1dADJNNpSrWqcCkRo87DRa4ZIVdTkViHjJipJlWmENRm5mpyH1b5pq-Tj-MloqdeWURWSRWRXWBGrYheGn3Ot9vsLosbepbtZ-LvpIoxaKfpyV88SDHXaXbMMI-qukxbtFeebKzB8cFa_OP4ANIvtQA |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NSsQwEB78A734L_6sGkTES91urGkDXhZRFHfLHlbZW2mTFCvaynb9PfkIPoLP4qP4JE7S7qqgIHgphU7aMpnJfJkk3wBsMtvlaAnK4jzECQpicosrT1ieYoIKDHC2WT0_b7i-73U6vDUE-_2zMAU_xCDhpj3DjNfawXVCuvqFNTS826HU5u4wjDoYZbSVU6c1GIeZU2xg9DT5LeOdPq-QTauDpt-j0SfE_ApUTaQ5mvrfP07DZIkwSb0wiRkYUuksLDYNG3f3kWwRP0TrIqVTz8FFM3xIrpMnjGEE0SC5N8lSJUlRLIRkMbm8zXvvzy9JihddjJ5cZlFOkvTtNXx7lZp6V1fNwibxVXaPMvlFdkNw2oxhTJ92JwVd9DycHR22D46tsv6CJSjXK7uurRChhdJVlLkK9ckippQralJ6MdcpKKU8TW0bot8LbseI_wQ-21M0jmJvdwFG0ixVi0AkkzyuubUo4rGDJhAyibJUCsejHDHaEmz3-yEQJTm5rpFxFRS0yjRATQZGk0uwMRC9KRg5fhKq9DszKJ0yD_QaK6JVHMTwc6bbfn9B4NfPzc3y30XXYfy43WwEjRP_dAUmdGH6Yo9PBUZ63Vu1CmPirpfk3TVjqB_V-O-L |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3LSsNAFL1oFXHjW-p7EBE3selYJxlwI2pRrEFEpbuQzAMjNSlNfa78BD_Bb_FT_BLvJGlVUBDchEDuJGHm3rlnXucArDHb4egJyuI8wAEKYnKLK1dYrmKCCkxwdrZ6ftlwPM9tNvnpAOz0zsLk_BD9CTcTGVl_bQJctaWufGENDe42KbW5MwhDNSMiU4Kh_bP6RaPfE7NavoXRNfS3jDd7zEI2rfQLf89HnyDzK1TNck19_H9_OQFjBcYku7lTTMKAiqegfJLxcXceyTrxAvQvUoT1NFydBA_RTfSEWYwgHiT32XSpkiSXCyGJJte3aff9-SWK8WLk6Ml1EqYkit9eg7dXach3jW4WFtGt5B5t0qukTXDgjInMnHcnOWH0DFzUD873Dq1CgcESlJu1XcdWiNEC6SjKHIX1yUKmlCOqUrqam0kopVxDbhtg5Atua0SAAp9tK6pD7W7NQilOYlUGIpnkuupUw5DrGjpBwCTaUilqLuWI0uZgo9cOvijoyY1KRsvPiZWpjzXpZzU5B6t903bOyfGT0WKvMf0iLFPfrLIiXsVuDD-XNdvvL_C93cvsZv7vpiswcrpf9xtH3vECjBpl-nyTzyKUup1btQTD4q4bpZ3lwlM_AM_z8KE |
| 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=Maximizing+the+weighted+number+of+just%E2%80%90in%E2%80%90time+jobs+in%C2%A0a%C2%A0distributed+flow%E2%80%90shop+scheduling+system&rft.jtitle=Naval+research+logistics&rft.au=Shabtay%2C+Dvir&rft.date=2023-04-01&rft.pub=John+Wiley+%26+Sons%2C+Inc&rft.issn=0894-069X&rft.eissn=1520-6750&rft.volume=70&rft.issue=3&rft.spage=274&rft.epage=283&rft_id=info:doi/10.1002%2Fnav.22097&rft.externalDBID=10.1002%252Fnav.22097&rft.externalDocID=NAV22097 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0894-069X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0894-069X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0894-069X&client=summon |