Two‐agent scheduling on a single sequential and compatible batching machine
We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent...
Uložené v:
| Vydané v: | Naval research logistics Ročník 64; číslo 8; s. 628 - 641 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Wiley Subscription Services, Inc
01.12.2017
|
| Predmet: | |
| ISSN: | 0894-069X, 1520-6750 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs. |
|---|---|
| AbstractList | We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs. |
| Author | Yuan, Jinjiang Cheng, T.C.E. Li, Shisheng Ng, C.T. |
| Author_xml | – sequence: 1 givenname: Shisheng surname: Li fullname: Li, Shisheng organization: Zhongyuan University of Technology – sequence: 2 givenname: T.C.E. surname: Cheng fullname: Cheng, T.C.E. organization: The Hong Kong Polytechnic University – sequence: 3 givenname: C.T. surname: Ng fullname: Ng, C.T. organization: The Hong Kong Polytechnic University – sequence: 4 givenname: Jinjiang orcidid: 0000-0002-9814-615X surname: Yuan fullname: Yuan, Jinjiang email: yuanjj@zzu.edu.cn organization: Zhengzhou University |
| BookMark | eNp9kE1OwzAQhS1UJNrCghtEYsUi7dhO4nhZVfxJBTYFsbOmjtOmSu0Sp1TdcQTOyElwKSskWM1I8817M69HOtZZQ8g5hQEFYEOLbwNGhZBHpEtTBnEmUuiQLuQyiSGTLyek5_0SALIE0i65n27d5_sHzo1tI68XptjUlZ1HzkYY-dDVJvLmdRPGFdYR2iLSbrXGtpqFyQxbvdjjK9xXc0qOS6y9OfupffJ0fTUd38aTx5u78WgSa85BxmUJzJTItOQsLySXmKdYihI140CNNEIXVBsqITGsoHnO0iznJhfJDJCj4H1ycdBdNy7c5lu1dJvGBkvFgFIGPPgE6vJA6cZ535hSrZtqhc1OUVD7tFRIS32nFdjhL1ZXbfjS2bbBqv5vY1vVZve3tHoYPR82vgBkHX6S |
| CitedBy_id | crossref_primary_10_1007_s10100_024_00954_9 crossref_primary_10_1007_s10479_019_03160_y crossref_primary_10_1007_s40747_021_00355_4 crossref_primary_10_1016_j_ejor_2025_01_034 crossref_primary_10_1142_S0217595918500379 crossref_primary_10_1016_j_ejor_2020_07_064 crossref_primary_10_1080_00207543_2024_2432473 crossref_primary_10_1016_j_cie_2019_02_047 crossref_primary_10_1016_j_ejor_2019_07_072 crossref_primary_10_1007_s10951_023_00779_5 crossref_primary_10_1007_s10951_020_00656_5 crossref_primary_10_1080_0305215X_2019_1678609 |
| Cites_doi | 10.1007/BF02248589 10.1016/S0167-6377(00)00040-7 10.1287/opre.1090.0744 10.1016/S0377-2217(99)00153-8 10.1016/0167-6377(94)90063-9 10.1023/A:1022231419049 10.1007/s10951-014-0368-y 10.1016/j.apm.2009.04.007 10.1287/opre.1030.0092 10.1007/s10479-006-0164-y 10.1016/j.ejor.2010.03.003 10.1007/s40305-016-0124-4 10.1007/s10951-013-0360-y 10.1007/978-3-642-41880-8 10.1016/0166-218X(93)90085-3 10.1016/j.cie.2015.12.003 10.1007/s10951-011-0253-x 10.1287/opre.43.4.692 10.1016/j.ejor.2016.10.024 10.1057/jors.1992.66 10.1002/nav.21562 10.1016/j.ipl.2009.04.018 10.1007/s10951-005-4997-z 10.1016/j.ejor.2013.09.017 10.1002/nav.21700 10.1016/j.tcs.2006.07.011 10.1016/j.ejor.2007.04.040 10.1007/s10951-014-0410-0 10.1016/j.disopt.2015.02.001 10.1016/S0167-6377(01)00069-4 10.1016/S0020-0190(02)00205-3 10.1007/s10951-012-0274-0 10.1007/BF01303431 10.1080/07408170108936839 10.1287/moor.17.1.36 10.1016/j.ejor.2011.06.037 10.1007/s10878-006-9001-0 |
| ContentType | Journal Article |
| Copyright | 2018 Wiley Periodicals, Inc. 2017 Wiley Periodicals, Inc. |
| Copyright_xml | – notice: 2018 Wiley Periodicals, Inc. – notice: 2017 Wiley Periodicals, Inc. |
| DBID | AAYXX CITATION 7SC 7TB 7TN 8FD F1W FR3 H96 JQ2 KR7 L.G L7M L~C L~D |
| DOI | 10.1002/nav.21779 |
| DatabaseName | 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 |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Military & Naval Science |
| EISSN | 1520-6750 |
| EndPage | 641 |
| ExternalDocumentID | 10_1002_nav_21779 NAV21779 |
| Genre | article |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China funderid: 11401605; 11501279; 11671368; 11701595; 11771406 – fundername: Hong Kong Polytechnic University funderid: G‐UB08 |
| GroupedDBID | --Z -~X .3N .GA .Y3 05W 0R~ 10A 123 186 1L6 1OB 1OC 1OL 1ZS 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 AAHHS AAHQN AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABEML ABIJN ABTAH ACAHQ ACBWZ ACCFJ ACCZN ACGFS ACIWK ACNCT ACPOU ACRPL ACSCC ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADNMO ADOZA ADXAS ADZMN AEEZP AEIGN AEIMD AEMOZ AENEX AEQDE AEUQT AEUYR AFBPY AFFNX AFFPM AFGKR AFPWT AFWVQ AFZJQ AHBTC AHQJS AITYG AIURR AIWBW AJBDE 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 RWI RX1 SAMSI SUPJJ TH9 TN5 UAO UB1 V2E W8V W99 WBKPD WH7 WIB WIH WIK WOHZO WQJ WRC WWM WXSBR WYISQ XBAML XG1 XPP XV2 ZY4 ZZTAW ~IA ~WT AAMMB AAYXX ADXHL AEFGJ AEYWJ AGHNM AGQPQ AGXDD AGYGG AIDQK AIDYY AIQQE CITATION O8X 7SC 7TB 7TN 8FD F1W FR3 H96 JQ2 KR7 L.G L7M L~C L~D |
| ID | FETCH-LOGICAL-c3309-ff02efa2c9328d939a85af7fac2301e9e7cd1ce1904e2d18825683e874b0a3a73 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 12 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000426793700002&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 | Sun Jul 13 02:54:37 EDT 2025 Sat Nov 29 02:12:59 EST 2025 Tue Nov 18 20:40:37 EST 2025 Wed Jan 22 16:55:31 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 8 |
| Language | English |
| License | http://onlinelibrary.wiley.com/termsAndConditions#vor |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3309-ff02efa2c9328d939a85af7fac2301e9e7cd1ce1904e2d18825683e874b0a3a73 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-9814-615X |
| PQID | 2011203330 |
| PQPubID | 1016414 |
| PageCount | 17 |
| ParticipantIDs | proquest_journals_2011203330 crossref_primary_10_1002_nav_21779 crossref_citationtrail_10_1002_nav_21779 wiley_primary_10_1002_nav_21779_NAV21779 |
| PublicationCentury | 2000 |
| PublicationDate | December 2017 2017-12-00 20171201 |
| PublicationDateYYYYMMDD | 2017-12-01 |
| PublicationDate_xml | – month: 12 year: 2017 text: December 2017 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Naval research logistics |
| PublicationYear | 2017 |
| Publisher | Wiley Subscription Services, Inc |
| Publisher_xml | – name: Wiley Subscription Services, Inc |
| References | 2011; 215 2010; 34 1993; 47 2015; 16 2010; 58 2000; 27 2015; 18 2010; 206 2006; 12 1992; 17 2001; 28 2016; 92 2012; 15 2008; 188 2014; 61 2014; 235 2017; 258 2016; 4 2004; 52 2013; 16 2007; 150 1990; 26 2002; 83 2003; 6 2005; 8 1995; 43 2016; 63 2006; 362 1994; 16 2000; 120 2014 2001; 33 1992; 43 2009; 109 1996; 43 2014; 31 e_1_2_9_30_1 e_1_2_9_31_1 e_1_2_9_11_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_12_1 e_1_2_9_33_1 Yuan J. J. (e_1_2_9_39_1) 2005; 8 He C. (e_1_2_9_16_1) 2015; 16 e_1_2_9_15_1 e_1_2_9_38_1 e_1_2_9_14_1 e_1_2_9_17_1 e_1_2_9_36_1 e_1_2_9_37_1 e_1_2_9_19_1 e_1_2_9_18_1 e_1_2_9_20_1 e_1_2_9_22_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 Li S. S. (e_1_2_9_21_1) 2014; 31 e_1_2_9_9_1 e_1_2_9_26_1 e_1_2_9_25_1 e_1_2_9_28_1 e_1_2_9_27_1 Agnetis A. (e_1_2_9_2_1) 2014 e_1_2_9_29_1 |
| References_xml | – volume: 18 start-page: 315 year: 2015 end-page: 323 article-title: A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints publication-title: Journal of Scheduling – volume: 63 start-page: 416 year: 2016 end-page: 429 article-title: CON/SLK due date assignment and scheduling on a single machine with two agents publication-title: Naval Research Logistics (Nrl) – volume: 4 start-page: 379 year: 2016 end-page: 384 article-title: Complexities of some problems on multi‐agent scheduling on a single machine publication-title: Journal of the Operations Research Society of China – volume: 18 start-page: 147 year: 2015 end-page: 153 article-title: Two‐agent single‐machine scheduling with release dates and preemption to minimize the maximum lateness publication-title: Journal of Scheduling – volume: 18 start-page: 423 year: 2015 end-page: 434 article-title: Two‐agent scheduling with agent specific batches on an unbounded serial batching machine publication-title: Journal of Scheduling – volume: 120 start-page: 228 year: 2000 end-page: 249 article-title: Scheduling with batching: A review publication-title: European Journal of Operational Research – volume: 188 start-page: 603 year: 2008 end-page: 609 article-title: Multi‐agent scheduling on a single machine with max‐form criteria publication-title: European Journal of Operational Research – volume: 58 start-page: 458 year: 2010 end-page: 469 article-title: Competitive two‐agent scheduling and its applications publication-title: Operations Research – volume: 52 start-page: 229 year: 2004 end-page: 242 article-title: Scheduling problems with two competing agents publication-title: Operations Research – volume: 8 start-page: 537 year: 2005 end-page: 542 article-title: A note on the scheduling with two families of jobs publication-title: Journal of Scheduling – volume: 215 start-page: 524 year: 2011 end-page: 531 article-title: Single machine batch scheduling with two competing agents to minimize total flowtime publication-title: European Journal of Operational Research – volume: 109 start-page: 913 year: 2009 end-page: 917 article-title: Approximation algorithms for multi‐agent scheduling to minimize total weighted completion time publication-title: Information Processing Letters – volume: 28 start-page: 213 year: 2001 end-page: 219 article-title: A simple efficient approximation scheme for the restricted shortest path problem publication-title: Operations Research Letters – volume: 258 start-page: 478 year: 2017 end-page: 490 article-title: Two‐agent scheduling on a single parallel‐batching machine with equal processing time and non‐identical job sizes publication-title: European Journal of Operational Research – volume: 43 start-page: 692 year: 1995 end-page: 703 article-title: Scheduling groups of jobs on a single machine publication-title: Operations Research – year: 2014 – volume: 362 start-page: 273 year: 2006 end-page: 281 article-title: Multi‐agent scheduling on a single machine to minimize total weighted number of tardy jobs publication-title: Theoretical Computer Science – volume: 61 start-page: 1 year: 2014 end-page: 16 article-title: Single machine just‐in‐time scheduling problems with two competing agents publication-title: Naval Research Logistics (Nrl) – volume: 16 start-page: 79 year: 1994 end-page: 86 article-title: Scheduling with batching: Minimizing the weighted number of tardy jobs publication-title: Operations Research Letters – volume: 26 start-page: 135 year: 1990 end-page: 147 article-title: Batch sizing and job sequencing on a single machine publication-title: Annals of Operations Research – volume: 43 start-page: 1 year: 1996 end-page: 8 article-title: Single machine batch scheduling to minimize the weighted number of late jobs publication-title: Mathematical Methods of Operations Research – volume: 206 start-page: 540 year: 2010 end-page: 546 article-title: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures publication-title: European Journal of Operational Research – volume: 43 start-page: 395 year: 1992 end-page: 406 article-title: Integrating scheduling with batching and lot‐sizing: A review of algorithms and complexity publication-title: Journal of the Operational Research Society – volume: 47 start-page: 87 year: 1993 end-page: 107 article-title: The complexity of one‐machine batching problems publication-title: Discrete Applied Mathematics – volume: 33 start-page: 413 year: 2001 end-page: 420 article-title: Single machine batch scheduling with sequential job processing publication-title: IIE Transactions – volume: 12 start-page: 387 year: 2006 end-page: 394 article-title: A note on the complexity of the problem of two‐agent scheduling on a single machine publication-title: Journal of Combinatorial Optimization – volume: 83 start-page: 287 year: 2002 end-page: 291 article-title: An improved FPTAS for restricted shortest path publication-title: Information Processing Letters – volume: 235 start-page: 1 year: 2014 end-page: 16 article-title: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi‐agent scheduling problems publication-title: European Journal of Operational Research – volume: 17 start-page: 36 year: 1992 end-page: 42 article-title: Approximation schemes for the restricted shortest path problem publication-title: Mathematics of Operations Research – volume: 92 start-page: 16 year: 2016 end-page: 30 article-title: Two‐agent single‐machine scheduling to minimize the batch delivery cost publication-title: Computers & Industrial Engineering – volume: 16 start-page: 70 year: 2015 end-page: 75 article-title: Bounded serial‐batching scheduling for minimizing maximum lateness and makespan publication-title: Discrete Optimization – volume: 16 start-page: 261 year: 2013 end-page: 271 article-title: Bounded parallel‐batching scheduling with two competing agents publication-title: Journal of Scheduling – volume: 6 start-page: 7 year: 2003 end-page: 16 article-title: A multiple‐criterion model for machine scheduling publication-title: Journal of Scheduling – volume: 27 start-page: 109 year: 2000 end-page: 118 article-title: Improved dynamic programs for some batching problems involving the maximum lateness criterion publication-title: Operations Research Letters – volume: 31 start-page: 145 year: 2014 end-page: 148 article-title: Group scheduling with two competing agents on a single machine publication-title: Asia‐Pacific Journal of Operational Research – volume: 34 start-page: 314 year: 2010 end-page: 324 article-title: Optimal methods for batch processing problem with makespan and maximum lateness objectives publication-title: Applied Mathematical Modelling – volume: 150 start-page: 3 year: 2007 end-page: 15 article-title: Multi‐agent single machine scheduling publication-title: Annals of Operations Research – volume: 15 start-page: 629 year: 2012 end-page: 640 article-title: Unbounded parallel‐batching scheduling with two competitive agents publication-title: Journal of Scheduling – ident: e_1_2_9_11_1 doi: 10.1007/BF02248589 – ident: e_1_2_9_30_1 doi: 10.1016/S0167-6377(00)00040-7 – ident: e_1_2_9_20_1 doi: 10.1287/opre.1090.0744 – ident: e_1_2_9_28_1 doi: 10.1016/S0377-2217(99)00153-8 – ident: e_1_2_9_17_1 doi: 10.1016/0167-6377(94)90063-9 – ident: e_1_2_9_6_1 doi: 10.1023/A:1022231419049 – ident: e_1_2_9_31_1 doi: 10.1007/s10951-014-0368-y – ident: e_1_2_9_34_1 doi: 10.1016/j.apm.2009.04.007 – ident: e_1_2_9_3_1 doi: 10.1287/opre.1030.0092 – ident: e_1_2_9_4_1 doi: 10.1007/s10479-006-0164-y – ident: e_1_2_9_24_1 doi: 10.1016/j.ejor.2010.03.003 – ident: e_1_2_9_37_1 doi: 10.1007/s40305-016-0124-4 – volume: 31 start-page: 145 year: 2014 ident: e_1_2_9_21_1 article-title: Group scheduling with two competing agents on a single machine publication-title: Asia‐Pacific Journal of Operational Research – ident: e_1_2_9_38_1 doi: 10.1007/s10951-013-0360-y – volume-title: Multi‐agent scheduling: Models and algorithms year: 2014 ident: e_1_2_9_2_1 doi: 10.1007/978-3-642-41880-8 – ident: e_1_2_9_5_1 doi: 10.1016/0166-218X(93)90085-3 – ident: e_1_2_9_36_1 doi: 10.1016/j.cie.2015.12.003 – ident: e_1_2_9_22_1 doi: 10.1007/s10951-011-0253-x – ident: e_1_2_9_33_1 doi: 10.1287/opre.43.4.692 – ident: e_1_2_9_32_1 doi: 10.1016/j.ejor.2016.10.024 – ident: e_1_2_9_29_1 doi: 10.1057/jors.1992.66 – ident: e_1_2_9_14_1 doi: 10.1002/nav.21562 – ident: e_1_2_9_19_1 doi: 10.1016/j.ipl.2009.04.018 – volume: 8 start-page: 537 year: 2005 ident: e_1_2_9_39_1 article-title: A note on the scheduling with two families of jobs publication-title: Journal of Scheduling doi: 10.1007/s10951-005-4997-z – ident: e_1_2_9_27_1 doi: 10.1016/j.ejor.2013.09.017 – ident: e_1_2_9_35_1 doi: 10.1002/nav.21700 – ident: e_1_2_9_9_1 doi: 10.1016/j.tcs.2006.07.011 – ident: e_1_2_9_10_1 doi: 10.1016/j.ejor.2007.04.040 – ident: e_1_2_9_18_1 doi: 10.1007/s10951-014-0410-0 – volume: 16 start-page: 70 year: 2015 ident: e_1_2_9_16_1 article-title: Bounded serial‐batching scheduling for minimizing maximum lateness and makespan publication-title: Discrete Optimization doi: 10.1016/j.disopt.2015.02.001 – ident: e_1_2_9_23_1 doi: 10.1016/S0167-6377(01)00069-4 – ident: e_1_2_9_12_1 doi: 10.1016/S0020-0190(02)00205-3 – ident: e_1_2_9_13_1 doi: 10.1007/s10951-012-0274-0 – ident: e_1_2_9_7_1 doi: 10.1007/BF01303431 – ident: e_1_2_9_8_1 doi: 10.1080/07408170108936839 – ident: e_1_2_9_15_1 doi: 10.1287/moor.17.1.36 – ident: e_1_2_9_25_1 doi: 10.1016/j.ejor.2011.06.037 – ident: e_1_2_9_26_1 doi: 10.1007/s10878-006-9001-0 |
| SSID | ssj0006405 |
| Score | 2.2206202 |
| Snippet | We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility... |
| SourceID | proquest crossref wiley |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 628 |
| SubjectTerms | Approximation Batch processing Compatibility Completion time Criteria dynamic programming FPTAS Lateness Mathematical models Optimization Polynomials Production scheduling Scheduling sequential and compatible batch single‐machine scheduling two agents Upper bounds |
| Title | Two‐agent scheduling on a single sequential and compatible batching machine |
| URI | https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fnav.21779 https://www.proquest.com/docview/2011203330 |
| Volume | 64 |
| WOSCitedRecordID | wos000426793700002&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 - Journals 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/eLvHCXMwpV1LSwMxEA61evDiW3xUCSLiZe0m2SeeRC0ebBFR6W2ZzQOEupW2Kt78Cf5Gf4mT7LZWUBC8LezsK8nMfJOd-YaQfY1Rh4g1eKGJQi9QLPSAC-kl0piYy4ApKV2zibjTSbrd9KpGjse1MCU_xGTDzWqGs9dWwSEfNqdIQ-H5CPF0nM6QWVtUhZHX7Nl16_ZyYoijoMxgTCz7bZR2x8RCPm9OLv7ujr4w5jRSda6mtfivl1wiCxXCpCflklgmNV2skI22Y-MevNID2gFcXbRS6lXSvnnpf7y9g62xohjrou-xJeq0X1Cgdiehp2mZcI3GoEehUNQlro_uczyToym3m1j0wWVl6jVy2zq_Ob3wqiYLnhT274oxPtcGuEQgl6hUpJCEYGIDEoMTplMdS8WkRtwQaK4YAvIwSoRO4iD3QUAs1km96Bd6g1CmMZpUynClRKB8kQYMeMQ5y1kAEMlNcjge60xWDOS2EUYvK7mTeYbDlbnh2iR7E9HHknbjJ6HGeMKySvOGmQU03Bf4bfg4NzW_3yDrnNy5g62_i26TeW49u8toaZD6aPCkd8icfB7dDwe71RL8BPPn4Ek |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bSxtBFD5oUtAXtVVJrJehSPFlzc5ld3bBF7ENkSZLKVHytkzmAoG4kSQqvvkT_I3-ks7MbqKFCoW-LezZ28ycc75z9sx3AI61jToo1yKITBwFTOEoEITKIJHGcCIZVlL6ZhM8y5LBIP25AmeLvTAlP8Qy4eY0w9trp-AuId16wxoq7k8toObpKtRZTHlSg_q3X-2r7tISx6wsYUwc_W2cDhbMQiFpLS_-0x-9gsy3UNX7mvbm_73lFmxUGBOdl4viI6zo4hM0ep6Pe_qIvqJM2PWFKrXehl7_YfLy9CzcLitko13rfdwmdTQpkEAulzDWqCy5tuZgjEShkC9dn4-G9szQGnOXxkI3vi5T78BV-3v_ohNUbRYCSd3_FWNCoo0g0kK5RKU0FUkkDDdC2vAE61RzqbDUFjkwTRS2kDyKE6oTzoahoILTXagVk0I3AGFt40mlDFGKMhXSlGFBYkLwEDMhYtmEk8Vg57LiIHetMMZ5yZ5McjtcuR-uJnxZit6WxBt_E9pfzFhe6d4sd5CGhNR-m32cn5v3b5Bn59f-YO_fRY9grdPvdfPuZfbjM6wT5-d9fcs-1ObTO30AH-T9fDSbHlbr8TdkmeQ5 |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1JS8NAFH5oFfHiLq3rICJeopklG3gRtShqKKLSW5jOAkJNS1sVb_4Ef6O_xJlJWisoCN4CmWwzb_ney3vfAOwqE3XQSHEv0GHgMYkDjxMqvFhoHRHBsBTCbTYRpWncbCaNCTga9sIU_BCjhJvVDGevrYKrrtSHY6yh_PnAAOoomYQpFiQBq8DU6U397mpkiUNWlDDGlv42TJpDZiGfHI4u_u6PvkDmOFR1vqY-_7-3XIC5EmOi40IoFmFC5UtQvXZ83L1XtIdSbuQLlWq9DNe3L52Pt3duu6yQiXaN97FN6qiTI45sLqGtUFFybcxBG_FcIle6PnhomTMtY8xtGgs9urpMtQJ39bPbk3Ov3GbBE9T-X9HaJ0pzIgyUi2VCEx4HXEeaCxOeYJWoSEgslEEOTBGJDSQPwpiqOGItn1Me0VWo5J1cVQFhZeJJKTWRkjLp04RhTkJCcAszzkNRg_3hZGei5CC3W2G0s4I9mWRmujI3XTXYGQ3tFsQbPw3aGK5YVupeP7OQhvjUfJt5nFub32-Qpcf37mDt70O3YaZxWs-uLtLLdZgl1s278pYNqAx6T2oTpsXz4KHf2yrF8RMZG-O0 |
| 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=Two%E2%80%90agent+scheduling+on+a+single+sequential+and+compatible+batching+machine&rft.jtitle=Naval+research+logistics&rft.au=Li%2C+Shisheng&rft.au=Cheng%2C+T.C.E.&rft.au=Ng%2C+C.T.&rft.au=Yuan%2C+Jinjiang&rft.date=2017-12-01&rft.issn=0894-069X&rft.eissn=1520-6750&rft.volume=64&rft.issue=8&rft.spage=628&rft.epage=641&rft_id=info:doi/10.1002%2Fnav.21779&rft.externalDBID=10.1002%252Fnav.21779&rft.externalDocID=NAV21779 |
| 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 |