Two-agent scheduling with agent specific batches on an unbounded serial batching machine

We study a scheduling problem, in which jobs of two agents are performed in agent specific batches on the same serial unbounded batching machine. On this machine, jobs of the same batch complete simultaneously, and the batch processing time is equal to the total processing time of its jobs plus a se...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of scheduling Vol. 18; no. 4; pp. 423 - 434
Main Authors:	Kovalyov, Mikhail Y., Oulamara, Ammar, Soukhal, Ameur
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2015 Springer Nature B.V Springer Verlag
Subjects:	Artificial Intelligence Batch processing Business and Management Calculus of Variations and Optimal Control; Optimization Computer Science Consolidation Customers Dynamic programming Functions (mathematics) Hierarchies Logistics Manufacturing Mathematical analysis Operations Research Operations Research/Decision Theory Optimization Polynomials Preventive maintenance Production scheduling Scheduling Serials Studies Supply Chain Management Multi-agent Scheduling Dynamic programming Serial batching machine Distribution center
ISSN:	1094-6136, 1099-1425
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	We study a scheduling problem, in which jobs of two agents are performed in agent specific batches on the same serial unbounded batching machine. On this machine, jobs of the same batch complete simultaneously, and the batch processing time is equal to the total processing time of its jobs plus a setup time. Each agent aims at minimizing a function which depends only on the completion times of its jobs. The problem is to find a schedule that minimizes the objective function of one agent, subject to the objective function of the other agent does not exceed a given threshold. The problem appears in optimizing product consolidation operations of a cross-docking distribution center. Polynomial and pseudo-polynomial dynamic programming algorithms are derived for settings with various combinations of the objective functions.
AbstractList	We study a scheduling problem, in which jobs of two agents are performed in agent specific batches on the same serial unbounded batching machine. On this machine, jobs of the same batch complete simultaneously, and the batch processing time is equal to the total processing time of its jobs plus a setup time. Each agent aims at minimizing a function which depends only on the completion times of its jobs. The problem is to find a schedule that minimizes the objective function of one agent, subject to the objective function of the other agent does not exceed a given threshold. The problem appears in optimizing product consolidation operations of a cross-docking distribution center. Polynomial and pseudo-polynomial dynamic programming algorithms are derived for settings with various combinations of the objective functions. Issue Title: Special Issue: New Perspectives in Scheduling Theory We study a scheduling problem, in which jobs of two agents are performed in agent specific batches on the same serial unbounded batching machine. On this machine, jobs of the same batch complete simultaneously, and the batch processing time is equal to the total processing time of its jobs plus a setup time. Each agent aims at minimizing a function which depends only on the completion times of its jobs. The problem is to find a schedule that minimizes the objective function of one agent, subject to the objective function of the other agent does not exceed a given threshold. The problem appears in optimizing product consolidation operations of a cross-docking distribution center. Polynomial and pseudo-polynomial dynamic programming algorithms are derived for settings with various combinations of the objective functions.
Author	Kovalyov, Mikhail Y. Oulamara, Ammar Soukhal, Ameur
Author_xml	– sequence: 1 givenname: Mikhail Y. surname: Kovalyov fullname: Kovalyov, Mikhail Y. organization: United Institute of Informatics Problems, National Academy of Sciences of Belarus – sequence: 2 givenname: Ammar surname: Oulamara fullname: Oulamara, Ammar email: oulamara@loria.fr organization: University of Lorraine – sequence: 3 givenname: Ameur surname: Soukhal fullname: Soukhal, Ameur organization: Laboratory of Computer Science (EA 6300), Team Scheduling and Control (ERL CNRS 6305), University François Rabelais - Tours
BackLink	https://hal.science/hal-02990789$$DView record in HAL
BookMark	eNp9kUFrFTEUhYNUsK3-AHcDbnQRvTcvM5ksS1ErPHBTwV3IJPe9lzIveSYzlv57M04FKejqhpPv5J5wLthZTJEYe43wHgHUh4KgW-SAkoNE4PCMnVdJc5SiPft9lrzDTfeCXZRyBwC9EnjOvt_eJ273FKemuAP5eQxx39yH6dA8qidyYRdcM9ipAqVJsbGxmeOQ5ujJN4VysON6vXiPdpn0kj3f2bHQq8d5yb59-nh7fcO3Xz9_ub7acid7OXFU1NUghFb2DrtBO8JhEMIjeFK-FdRupFStB-hc67ElJwarVN91GrzfbS7Zu_Xdgx3NKYejzQ8m2WBurrZm0UBoDarXP7Gyb1f2lNOPmcpkjqE4GkcbKc3FoMJeC-hBVPTNE_QuzTnWnxism3XXalSVUivlciol0864MNkppDhlG0aDYJZ2zNqOqe2YpR0D1YlPnH-y_88jVk-pbNxT_ivTP02_AAwxod0
CitedBy_id	crossref_primary_10_1007_s10479_019_03160_y crossref_primary_10_1007_s11590_022_01967_6 crossref_primary_10_1016_j_cie_2017_07_029 crossref_primary_10_1142_S0217595918500379 crossref_primary_10_1080_00207543_2020_1820095 crossref_primary_10_1016_j_cie_2019_02_047 crossref_primary_10_1007_s40747_021_00355_4 crossref_primary_10_1080_00207543_2021_1923854 crossref_primary_10_1007_s40747_020_00184_x crossref_primary_10_1080_00207543_2025_2525534 crossref_primary_10_1007_s10479_018_2839_6 crossref_primary_10_1016_j_cor_2025_107144 crossref_primary_10_1080_00207543_2020_1748908 crossref_primary_10_1007_s10951_020_00656_5 crossref_primary_10_1002_nav_21700 crossref_primary_10_1016_j_cie_2017_07_013 crossref_primary_10_1007_s00500_024_10395_w crossref_primary_10_1007_s13369_017_2900_9 crossref_primary_10_1016_j_ejor_2025_01_034 crossref_primary_10_1080_00207543_2024_2432473 crossref_primary_10_1080_00207543_2017_1285077 crossref_primary_10_1007_s10951_019_00623_9 crossref_primary_10_1080_0305215X_2019_1678609 crossref_primary_10_1002_nav_21936 crossref_primary_10_1007_s10951_018_0583_z crossref_primary_10_1016_j_disopt_2021_100655 crossref_primary_10_1080_00207543_2018_1529445 crossref_primary_10_1002_nav_21813 crossref_primary_10_1016_j_cor_2021_105231 crossref_primary_10_1016_j_cie_2015_12_003 crossref_primary_10_1007_s10951_020_00646_7 crossref_primary_10_1002_nav_21779 crossref_primary_10_1007_s10288_018_0388_0
Cites_doi	10.1016/j.tcs.2006.07.011 10.1287/opre.43.4.692 10.1023/A:1022231419049 10.1057/jors.1992.66 10.1016/j.aei.2006.05.004 10.1023/A:1009637419820 10.1007/s10479-006-0164-y 10.1016/0166-218X(93)90085-3 10.1016/S0377-2217(03)00250-9 10.1287/opre.1060.0301 10.1287/opre.1030.0092 10.1016/j.apm.2009.04.007 10.1007/s10951-005-4997-z 10.1287/opre.1030.0101 10.1080/07408170490247368 10.1287/ijoc.13.2.120.10521 10.1016/S0377-2217(99)00153-8 10.1016/0167-6377(94)90063-9 10.1007/BF02248589 10.1111/j.1937-5956.1997.tb00415.x 10.1016/j.ejor.2004.07.011 10.1007/BF01303431 10.1016/j.cor.2007.10.006 10.1016/j.ejor.2008.10.038 10.1287/opre.1090.0744 10.1109/AIMSEC.2011.6009883 10.1007/s10951-011-0253-x 10.1007/s10951-011-0252-y 10.1016/j.ejor.2011.06.037 10.1016/S1474-6670(17)39472-7
ContentType	Journal Article
Copyright	Springer Science+Business Media New York 2014 Springer Science+Business Media New York 2015 licence_http://creativecommons.org/publicdomain/zero
Copyright_xml	– notice: Springer Science+Business Media New York 2014 – notice: Springer Science+Business Media New York 2015 – notice: licence_http://creativecommons.org/publicdomain/zero
DBID	AAYXX CITATION 3V. 7TA 7TB 7WY 7WZ 7X7 7XB 87Z 88C 8AL 8AO 8FD 8FE 8FG 8FI 8FJ 8FK 8FL ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FR3 FRNLG FYUFA F~G GHDGH GNUQQ HCIFZ JG9 JQ2 K60 K6~ K7- K9. L.- L.0 M0C M0N M0S M0T P5Z P62 PHGZM PHGZT PJZUB PKEHL PPXIY PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PYYUZ Q9U 1XC
DOI	10.1007/s10951-014-0410-0
DatabaseName	CrossRef ProQuest Central (Corporate) Materials Business File Mechanical & Transportation Engineering Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) Health & Medical Collection ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Healthcare Administration Database (Alumni) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology Collection ProQuest One ProQuest Central Engineering Research Database Business Premium Collection (Alumni) Health Research Premium Collection ABI/INFORM Global (Corporate) Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection Materials Research Database ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ProQuest Health & Medical Complete (Alumni) ABI/INFORM Professional Advanced ABI/INFORM Professional Standard ABI/INFORM Global Computing Database ProQuest Health & Medical Collection Healthcare Administration Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ABI/INFORM Collection China ProQuest Central Basic Hyper Article en Ligne (HAL)
DatabaseTitle	CrossRef Materials Research Database ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ABI/INFORM Complete Materials Business File ProQuest One Applied & Life Sciences Health Research Premium Collection Health & Medical Research Collection ProQuest Central (New) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) ProQuest Business Collection ProQuest Hospital Collection (Alumni) ProQuest Health & Medical Complete ProQuest One Academic UKI Edition ProQuest Health Management (Alumni Edition) Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Health & Medical Research Collection Health and Medicine Complete (Alumni Edition) ABI/INFORM Professional Standard ProQuest Central Korea ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest Health Management ABI/INFORM China ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni)
DatabaseTitleList	Materials Research Database Materials Research Database
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Business
EISSN	1099-1425
EndPage	434
ExternalDocumentID	oai:HAL:hal-02990789v1 3725327011 10_1007_s10951_014_0410_0
Genre	Feature
GroupedDBID	-57 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1OC 203 29L 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 31~ 3V. 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6NX 7WY 7X7 8-1 8AO 8FE 8FG 8FI 8FJ 8FL 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABIJN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACXQS ACZOJ ADBBV ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFBPY AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZJQ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHMBA AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJAOE AJBLW AJRNO AJZVZ ALIPV ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG AQUVI ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYQZM AZFZN AZQEC B-. BA0 BAPOH BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS BVXVI CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBLON EBS EDO EHE EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC FYUFA GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS H13 HCIFZ HF~ HG5 HG6 HLICF HMCUK HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV LAK LAW LH4 LLZTM M0C M0N M0T M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9G O9J OAM OVD P2P P62 P9M PF0 PQBIZ PQBZA PQQKQ PROAC PT4 Q2X QOS R89 R9I RNI ROL RPX RSV RZC RZD S16 S1Z S27 S3B SAP SBE SDH SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TEORI TSG TSK TSV TUC TUS U2A UG4 UKHRP UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 W99 WK8 XPP XV2 YLTOR Z45 Z7X Z83 Z88 ZMTXR ~A9 AAMMB AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEFGJ AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AGXDD AHPBZ AHWEU AIDQK AIDYY AIXLP ALUQN AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PJZUB PPXIY PQGLB 7TA 7TB 7XB 8AL 8FD 8FK FR3 JG9 JQ2 K9. L.- L.0 PKEHL PQEST PQUKI Q9U PUEGO 1XC
ID	FETCH-LOGICAL-c484t-17e6721e1a48c16b9ce1bb22d10de7d52e534475d006c5d15ec2ba7786690ddf3
IEDL.DBID	RSV
ISICitedReferencesCount	36
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000356818400009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1094-6136
IngestDate	Wed Nov 05 07:32:19 EST 2025 Thu Sep 04 16:10:59 EDT 2025 Tue Nov 04 22:04:35 EST 2025 Sat Nov 29 07:51:47 EST 2025 Tue Nov 18 22:23:48 EST 2025 Fri Feb 21 02:36:55 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	4
Keywords	Multi-agent Scheduling Dynamic programming Serial batching machine Distribution center
Language	English
License	licence_http://creativecommons.org/publicdomain/zero/: http://creativecommons.org/publicdomain/zero
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c484t-17e6721e1a48c16b9ce1bb22d10de7d52e534475d006c5d15ec2ba7786690ddf3
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
PQID	1690965917
PQPubID	43675
PageCount	12
ParticipantIDs	hal_primary_oai_HAL_hal_02990789v1 proquest_miscellaneous_1718920802 proquest_journals_1690965917 crossref_citationtrail_10_1007_s10951_014_0410_0 crossref_primary_10_1007_s10951_014_0410_0 springer_journals_10_1007_s10951_014_0410_0
PublicationCentury	2000
PublicationDate	2015-08-01
PublicationDateYYYYMMDD	2015-08-01
PublicationDate_xml	– month: 08 year: 2015 text: 2015-08-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Journal of scheduling
PublicationTitleAbbrev	J Sched
PublicationYear	2015
Publisher	Springer US Springer Nature B.V Springer Verlag
Publisher_xml	– name: Springer US – name: Springer Nature B.V – name: Springer Verlag
References	Hall, Potts (CR16) 2004; 52 Agnetis, Pacciarelli, Pacifici (CR3) 2007; 150 Hoogeveen (CR18) 2005; 167 Uzsoy, Yang (CR33) 1997; 6 Yazdani Sabouni, Jolai (CR35) 2010; 34 Webster, Baker (CR34) 1995; 43 Agnetis, Mirchandani, Pacciarelli, Pacifici (CR2) 2004; 52 CR19 CR14 CR13 Leung, Pinedo, Wan (CR22) 2010; 58 Coffman, Yannakakis, Magazine, Santos (CR12) 1990; 26 Potts, Van Wassenhove (CR29) 1992; 42 CR31 Brucker, Kovalyov (CR8) 1996; 43 Cheng, Kovalyov (CR9) 2001; 33 Kubzin, Strusevich (CR21) 2006; 54 Kovalyov, Potts, Strusevich (CR20) 2004; 157 Oulamara, Kovalyov, Finke (CR27) 2005; 37 Potts, Kovalyov (CR28) 2000; 120 Yuan, Shang, Feng (CR36) 2005; 8 Agnetis, Mirchandani, Pacciarelli, Pacifici (CR1) 2000; 6 Shen, Hao, Joong Yoon, Norrie (CR30) 2006; 20 CR4 Balasubramanian, Fowler, Keha, Pfund (CR7) 2009; 199 CR25 T’kindt, Billaut (CR32) 2006 CR24 CR23 Albers, Brucker (CR5) 1993; 47 Hochbaum, Landy (CR17) 1994; 16 Baker, Smith (CR6) 2003; 6 Oulamara, Finke, Kamgaing Kuiten (CR26) 2009; 36 Cheng, Kovalyov, Chakhlevich (CR10) 2004; 36 Cheng, Ng, Yuan (CR11) 2006; 362 Glass, Potts, Strusevich (CR15) 2001; 13 A Agnetis (410_CR3) 2007; 150 DS Hochbaum (410_CR17) 1994; 16 A Agnetis (410_CR1) 2000; 6 A Oulamara (410_CR26) 2009; 36 A Agnetis (410_CR2) 2004; 52 MT Yazdani Sabouni (410_CR35) 2010; 34 JJ Yuan (410_CR36) 2005; 8 410_CR4 MA Kubzin (410_CR21) 2006; 54 410_CR24 410_CR23 410_CR25 TCE Cheng (410_CR9) 2001; 33 MY Kovalyov (410_CR20) 2004; 157 CN Potts (410_CR29) 1992; 42 410_CR19 TCE Cheng (410_CR10) 2004; 36 CN Potts (410_CR28) 2000; 120 JYT Leung (410_CR22) 2010; 58 S Albers (410_CR5) 1993; 47 H Balasubramanian (410_CR7) 2009; 199 V T’kindt (410_CR32) 2006 410_CR31 J Hoogeveen (410_CR18) 2005; 167 410_CR13 NG Hall (410_CR16) 2004; 52 K Baker (410_CR6) 2003; 6 P Brucker (410_CR8) 1996; 43 W Shen (410_CR30) 2006; 20 S Webster (410_CR34) 1995; 43 410_CR14 EG Coffman Jr (410_CR12) 1990; 26 A Oulamara (410_CR27) 2005; 37 CA Glass (410_CR15) 2001; 13 TCE Cheng (410_CR11) 2006; 362 R Uzsoy (410_CR33) 1997; 6
References_xml	– volume: 362 start-page: 273 year: 2006 end-page: 281 ident: CR11 article-title: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2006.07.011 – volume: 43 start-page: 692 year: 1995 end-page: 704 ident: CR34 article-title: Scheduling groups of jobs on a single machine publication-title: Operations Research doi: 10.1287/opre.43.4.692 – volume: 6 start-page: 7 year: 2003 end-page: 16 ident: CR6 article-title: A multiple-criterion model for machine scheduling publication-title: Journal of Scheduling doi: 10.1023/A:1022231419049 – volume: 33 start-page: 413 year: 2001 end-page: 420 ident: CR9 article-title: Single machine batch scheduling with sequential job processing publication-title: IIE Transactions – volume: 37 start-page: 685 year: 2005 end-page: 696 ident: CR27 article-title: Scheduling a no-wait flowshop with unbounded batching machines publication-title: IIE Transactions on Scheduling and Logistics – ident: CR4 – ident: CR14 – volume: 42 start-page: 395 year: 1992 end-page: 406 ident: CR29 article-title: Integrating scheduling with batching and lotsizing: A review of algorithms and complexity publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1992.66 – volume: 20 start-page: 415 year: 2006 end-page: 431 ident: CR30 article-title: Applications of agent-based systems in intelligent manufacturing: An updated review publication-title: Advanced Engineering Informatics doi: 10.1016/j.aei.2006.05.004 – volume: 6 start-page: 191 year: 2000 end-page: 217 ident: CR1 article-title: Nondominated schedules for a job-shop with two competing users publication-title: Computational & Mathematical Organization Theory doi: 10.1023/A:1009637419820 – volume: 150 start-page: 3 year: 2007 end-page: 15 ident: CR3 article-title: Multi-agent single machine scheduling publication-title: Annals of Operations Research doi: 10.1007/s10479-006-0164-y – volume: 47 start-page: 87 year: 1993 end-page: 107 ident: CR5 article-title: The complexity of one-machine batching problems publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(93)90085-3 – volume: 157 start-page: 620 year: 2004 end-page: 642 ident: CR20 article-title: Batching decisions for assembly production systems publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(03)00250-9 – volume: 54 start-page: 789 year: 2006 end-page: 800 ident: CR21 article-title: Planning machine maintenance in two-machne shop scheduling publication-title: Operations Research doi: 10.1287/opre.1060.0301 – ident: CR25 – volume: 52 start-page: 229 year: 2004 end-page: 242 ident: CR2 article-title: Scheduling problems with two competing agents publication-title: Operations Research doi: 10.1287/opre.1030.0092 – volume: 34 start-page: 314 issue: 2 year: 2010 end-page: 324 ident: CR35 article-title: Optimal methods for batch processing problem with makespan and maximum lateness objectives publication-title: Applied Mathematical Modelling doi: 10.1016/j.apm.2009.04.007 – ident: CR23 – volume: 8 start-page: 537 year: 2005 end-page: 542 ident: CR36 article-title: A note on the scheduling with two families of jobs publication-title: Journal of Scheduling doi: 10.1007/s10951-005-4997-z – volume: 52 start-page: 440 year: 2004 end-page: 453 ident: CR16 article-title: Rescheduling for new orders publication-title: Operations Research doi: 10.1287/opre.1030.0101 – volume: 36 start-page: 87 year: 2004 end-page: 93 ident: CR10 article-title: Batching in a two-stage flowshop with dedicated machines in the second stage publication-title: IIE Transactions doi: 10.1080/07408170490247368 – volume: 13 start-page: 120 year: 2001 end-page: 137 ident: CR15 article-title: Scheduling batches with sequential job processing for two-machine flow and open shops publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.13.2.120.10521 – ident: CR19 – volume: 120 start-page: 228 year: 2000 end-page: 249 ident: CR28 article-title: Scheduling with batching: A review publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00153-8 – volume: 16 start-page: 79 year: 1994 end-page: 86 ident: CR17 article-title: Scheduling with batching: Minimizing the weighted number of tardy jobs publication-title: Operations Research Letters doi: 10.1016/0167-6377(94)90063-9 – year: 2006 ident: CR32 publication-title: Multicriteria scheduling: Theory, models and algorithms – ident: CR31 – ident: CR13 – volume: 26 start-page: 135 year: 1990 end-page: 147 ident: CR12 article-title: Batch sizing and job sequencing on a single machine publication-title: Annals of Operations Research doi: 10.1007/BF02248589 – volume: 6 start-page: 57 year: 1997 end-page: 73 ident: CR33 article-title: Minimizing total weighted completion time on a single batch processing machine publication-title: Production and Operations Management doi: 10.1111/j.1937-5956.1997.tb00415.x – volume: 167 start-page: 592 year: 2005 end-page: 623 ident: CR18 article-title: Multicriteria scheduling publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.011 – volume: 43 start-page: 1 year: 1996 end-page: 8 ident: CR8 article-title: Single machine batch scheduling to minimize the weighted number of late jobs publication-title: Mathematical Methods of Operations Research doi: 10.1007/BF01303431 – volume: 36 start-page: 391 year: 2009 end-page: 401 ident: CR26 article-title: Flowshop scheduling problem with batching machine and task compatibilities publication-title: Computers & Operations Research doi: 10.1016/j.cor.2007.10.006 – volume: 199 start-page: 55 year: 2009 end-page: 67 ident: CR7 article-title: Scheduling interfering job sets on parallel machines publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.10.038 – volume: 58 start-page: 458 year: 2010 end-page: 469 ident: CR22 article-title: Competitive two-agent scheduling and its applications publication-title: Operations Research doi: 10.1287/opre.1090.0744 – ident: CR24 – volume: 6 start-page: 191 year: 2000 ident: 410_CR1 publication-title: Computational & Mathematical Organization Theory doi: 10.1023/A:1009637419820 – volume: 43 start-page: 1 year: 1996 ident: 410_CR8 publication-title: Mathematical Methods of Operations Research doi: 10.1007/BF01303431 – volume: 52 start-page: 229 year: 2004 ident: 410_CR2 publication-title: Operations Research doi: 10.1287/opre.1030.0092 – volume: 150 start-page: 3 year: 2007 ident: 410_CR3 publication-title: Annals of Operations Research doi: 10.1007/s10479-006-0164-y – ident: 410_CR31 doi: 10.1109/AIMSEC.2011.6009883 – volume: 157 start-page: 620 year: 2004 ident: 410_CR20 publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(03)00250-9 – volume: 33 start-page: 413 year: 2001 ident: 410_CR9 publication-title: IIE Transactions – volume: 20 start-page: 415 year: 2006 ident: 410_CR30 publication-title: Advanced Engineering Informatics doi: 10.1016/j.aei.2006.05.004 – ident: 410_CR24 doi: 10.1007/s10951-011-0253-x – volume: 6 start-page: 57 year: 1997 ident: 410_CR33 publication-title: Production and Operations Management doi: 10.1111/j.1937-5956.1997.tb00415.x – volume: 362 start-page: 273 year: 2006 ident: 410_CR11 publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2006.07.011 – volume: 120 start-page: 228 year: 2000 ident: 410_CR28 publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00153-8 – volume: 13 start-page: 120 year: 2001 ident: 410_CR15 publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.13.2.120.10521 – volume: 34 start-page: 314 issue: 2 year: 2010 ident: 410_CR35 publication-title: Applied Mathematical Modelling doi: 10.1016/j.apm.2009.04.007 – volume: 6 start-page: 7 year: 2003 ident: 410_CR6 publication-title: Journal of Scheduling doi: 10.1023/A:1022231419049 – ident: 410_CR19 doi: 10.1007/s10951-011-0252-y – ident: 410_CR25 doi: 10.1016/j.ejor.2011.06.037 – ident: 410_CR4 – volume: 36 start-page: 87 year: 2004 ident: 410_CR10 publication-title: IIE Transactions doi: 10.1080/07408170490247368 – volume: 58 start-page: 458 year: 2010 ident: 410_CR22 publication-title: Operations Research doi: 10.1287/opre.1090.0744 – volume: 26 start-page: 135 year: 1990 ident: 410_CR12 publication-title: Annals of Operations Research doi: 10.1007/BF02248589 – volume: 36 start-page: 391 year: 2009 ident: 410_CR26 publication-title: Computers & Operations Research doi: 10.1016/j.cor.2007.10.006 – volume: 167 start-page: 592 year: 2005 ident: 410_CR18 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.011 – volume: 43 start-page: 692 year: 1995 ident: 410_CR34 publication-title: Operations Research doi: 10.1287/opre.43.4.692 – volume: 52 start-page: 440 year: 2004 ident: 410_CR16 publication-title: Operations Research doi: 10.1287/opre.1030.0101 – volume: 16 start-page: 79 year: 1994 ident: 410_CR17 publication-title: Operations Research Letters doi: 10.1016/0167-6377(94)90063-9 – volume-title: Multicriteria scheduling: Theory, models and algorithms year: 2006 ident: 410_CR32 – ident: 410_CR23 – volume: 47 start-page: 87 year: 1993 ident: 410_CR5 publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(93)90085-3 – volume: 37 start-page: 685 year: 2005 ident: 410_CR27 publication-title: IIE Transactions on Scheduling and Logistics – ident: 410_CR14 doi: 10.1016/S1474-6670(17)39472-7 – ident: 410_CR13 – volume: 8 start-page: 537 year: 2005 ident: 410_CR36 publication-title: Journal of Scheduling doi: 10.1007/s10951-005-4997-z – volume: 54 start-page: 789 year: 2006 ident: 410_CR21 publication-title: Operations Research doi: 10.1287/opre.1060.0301 – volume: 199 start-page: 55 year: 2009 ident: 410_CR7 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.10.038 – volume: 42 start-page: 395 year: 1992 ident: 410_CR29 publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1992.66
SSID	ssj0008721
Score	2.240672
Snippet	We study a scheduling problem, in which jobs of two agents are performed in agent specific batches on the same serial unbounded batching machine. On this... Issue Title: Special Issue: New Perspectives in Scheduling Theory We study a scheduling problem, in which jobs of two agents are performed in agent specific...
SourceID	hal proquest crossref springer
SourceType	Open Access Repository Aggregation Database Enrichment Source Index Database Publisher
StartPage	423
SubjectTerms	Artificial Intelligence Batch processing Business and Management Calculus of Variations and Optimal Control; Optimization Computer Science Consolidation Customers Dynamic programming Functions (mathematics) Hierarchies Logistics Manufacturing Mathematical analysis Operations Research Operations Research/Decision Theory Optimization Polynomials Preventive maintenance Production scheduling Scheduling Serials Studies Supply Chain Management
SummonAdditionalLinks	– databaseName: ABI/INFORM Global dbid: M0C link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLZ4CcGBxwBRGCggTqCIpuvzhBACcQDEAaTdqrwmJkELbIO_j92m20CCC9c0baM4jp3Y_j6Ao0AJhY4AcYQFkocmNTwLbcyF6vgqERY9kgrE9Sa5u0u73ezeXbgNXFplsydWG7UpNd2Rn1I4h8DvRHL2-saJNYqiq45CYxbmybOhlL5b_2K8E6dJXXeFRxg8InXiJqpZl84RwTweELgfUjz4m12afaKsyCmX80eUtDI-V6v_HfYarDi3k53X62QdZmzRgsUm670Fqw27A3PK3oLlKajCDeg-fJZcUh0Ww_Mw2icqY2d0i8tcKxHZ9_qaKUkLYcDKgsmCjQpFxE3WsHqt14_p3ZcqjdNuwuPV5cPFNXesDFyHaTjkIrExzqsVMky1iFWmrVAqCIzwjU1MFNioQhE0qM86MiKyOlCSYOpwKozpdbZgrigLuw1M4g7TsQTRrmVofJVZqXQP3X0RqTgTgQd-I5NcO8hyYs54zidgyyTGHMWYkxhz34Pj8SuvNV7HX50PUdDjfoS0fX1-k1ObT2Y6SbMP4UG7kWzu9HuQT8TqwcH4MWomhVtkYcsR9kGznwVUy-zBSbN-pj7x26h2_v7hLiyh0xbVSYhtmBu-j-weLOiPYX_wvl8pwBchSghM priority: 102 providerName: ProQuest
Title	Two-agent scheduling with agent specific batches on an unbounded serial batching machine
URI	https://link.springer.com/article/10.1007/s10951-014-0410-0 https://www.proquest.com/docview/1690965917 https://www.proquest.com/docview/1718920802 https://hal.science/hal-02990789
Volume	18
WOSCitedRecordID	wos000356818400009&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: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1099-1425 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: M0C dateStart: 20030101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1099-1425 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: P5Z dateStart: 20030101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1099-1425 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: K7- dateStart: 20030101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1099-1425 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: 7X7 dateStart: 20030101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: Healthcare Administration Database customDbUrl: eissn: 1099-1425 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: M0T dateStart: 20030101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthmanagement providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest ABI/INFORM Collection customDbUrl: eissn: 1099-1425 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: 7WY dateStart: 20030101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1099-1425 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: BENPR dateStart: 20030101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1099-1425 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008721 issn: 1094-6136 databaseCode: RSV dateStart: 20030101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dSxtBEB8aFakPfkSLV23Yik_Kwu3l7vbu0YoiVEOwUaMvx36FBupFTGL__c7cR4zSCvZl4faLZXdnZ-Zm5jcA-4EWGgUByhEWKB7axPI0dDEXuu1rKRxKJAWI67nsdJJ-P-1Wcdzj2tu9NkkWL_VcsBulhEeRnvshWXAbsIjcLqF8DZc_rmfPbyLLYCvUW1Avase1KfNvU7xgRo2f5Ao5J2e-Mo0WHOd07b_Wug6rlYDJjsobsQEfXN6E5dq_vQlrdR4HVpF1E1bmQAk3od_7PeKKIq4Yar7IiShgndH_WlbVUsr6wdAwrejIx2yUM5Wzaa4pRZOzrLzVZTONvS8cNt0WXJ2e9I7PeJV_gZswCSdcSBfjZjqhwsSIWKfGCa2DwArfOmmjwEUFXqBFyjWRFZEzgVYESIcqt7WD9idYyEe52wam8C1pOwJjNyq0vk6d0maAgr2IdJyKwAO_PojMVODklCPjV_YMq0xbmuGWZrSlme_BwWzIQ4nM8VbnPTzdWT_C1D47Os-ozieGLJP0SXiwWx9-VlHyOCMzIoEuCunB11kz0iAZVlTuRlPsgww-DShq2YPD-kLMTfGvVX1-V-8d-IjSWlR6H-7CwuRx6r7AknmaDMePLWjIm1sq-7IFi99OOt1L_PouOZYX_nFR9rDsRnetgmD-ACYYBLA
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB61BfE4UAggDAUWBBfQCu_6sfYBoQqoUiVEHIKU27KvCiSwQ5O04k_xG5nxIw1I9NYDV3vXz29mZ3ZmvgF4Jq2waAhQjzBpeOoLz8s05FzYJLZKBLRIGhLXsZpMitms_LgFv_paGEqr7HVio6h97WiP_BWFc4j8Tqg38x-cukZRdLVvodHCYhR-nqLLtnh9-A7_73MpD95P3w5511WAu7RIl1yokKPbE4RJCydyW7ogrJXSi9gH5TMZsoYFzyMeXeZFFpy0hmjW8Am8P0rwuttwKU0KRXI1Unyt-QvV1nmhy4QuWZL3UdS2VI8a2qNDwuOU4s9_rIPbXygLc8PE_Ssq2yx2B7v_22e6CTc6s5rtt3JwC7ZCNYArfVb_AHb77hWsU2YDuL5BxXgbZtPTmhuqM2Po7-P6S2X6jHapWXd0Hpr0RWYNAX3B6oqZiq0qS42pgmetLLenae73Jk013IFPF_Lid2GnqqtwD5hBDZoEoqB3JvWxLYOx7gjdGZHZvBQygrjHgHYdJTt1Bvmmz8ikCTYaYaMJNjqO4MV6yrzlIzlv8FME1nocMYkP98eajsVkhqiiPBER7PVI0p3-WugzGEXwZH0aNQ-Fk0wV6hWOQbOmlFSrHcHLHq8bl_jXU90__4aP4epw-mGsx4eT0QO4hgZq1iZc7sHO8ngVHsJld7L8ujh-1Agfg88XDePfkeFkuA
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB61BVX0QCGAMBRYEFxAq3o3fh4QqihRq0ZRDkWKuJh9pUUCO62TVvw1fh0ztjcNSPTWA1d7_f52dsbzzTcAr6UWGh0B6hEmFY9sZnkeuYQL3Q91Khx6JI2I6zAdjbLJJB-vwS9fC0O0Sm8TG0NtK0P_yHcpnUPidyLdnXa0iPH-4MPsjFMHKcq0-nYaLUSO3M9LDN_q94f7-K3fSDn4dPzxgHcdBriJsmjOReoSDIGcUFFmRKJz44TWUloRWpfaWLq4UcSziE0TWxE7I7UiyTW8G2unfTzvOtxKMcYkOuE4_rJcBbK0rfnC8AnDs37iM6pt2R41t8fghIcR5aL_WBPXT4mRueLu_pWhbRa-wfb__Mruwd3O3WZ77fy4D2uu7MGmZ_v3YNt3tWCdkevB1opE4wOYHF9WXFH9GasR35aI-yeM_l6zbuvMNbRGphVNgJpVJVMlW5SaGlY5y9o53u6mY3809FX3ED7fyIM_go2yKt1jYAota9-RNL1RkQ117pQ2UwxzRKyTXMgAQo-HwnRS7dQx5HtxJTJNECoQQgVBqAgDeLs8ZNbqlFw3-BWCbDmOFMYP9oYFbQvJPUmz_EIEsONRVXR2rS6uIBXAy-VutEiUZlKlqxY4Bt2dXFINdwDvPHZXTvGvu3py_QVfwCaitxgejo6ewh30W-OWh7kDG_PzhXsGt83F_Ft9_ryZhwy-3jSKfwPi0G3c
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-agent+scheduling+with+agent+specific+batches+on+an+unbounded+serial+batching+machine&rft.jtitle=Journal+of+scheduling&rft.au=Oulamara%2C+Ammar&rft.au=Kovalyov%2C+Mikhail&rft.au=Soukhal%2C+Ameur&rft.date=2015-08-01&rft.pub=Springer+Verlag&rft.issn=1094-6136&rft.eissn=1099-1425&rft.volume=18&rft.issue=4&rft.spage=423&rft.epage=434&rft_id=info:doi/10.1007%2Fs10951-014-0410-0&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-02990789v1
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1094-6136&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1094-6136&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1094-6136&client=summon