Integrated job-shop scheduling in an FMS with heterogeneous transporters: MILP formulation, constraint programming, and branch-and-bound

Current studies on scheduling of machines and transporters assume that either a single transporter or an infinite number of homogeneous transporters such as AGVs or mobile robots are available to transport semi-finished jobs, which seems very restrictive in practice. This paper addresses this gap by...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of production research Ročník 62; číslo 9; s. 3288 - 3304
Hlavní autoři:	Ahmadi-Javid, Amir, Haghi, Maryam, Hooshangi-Tabrizi, Pedram
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	London Taylor & Francis 02.05.2024 Taylor & Francis LLC
Témata:	AGVS Algorithms constraint programming (CP) Flexible manufacturing systems Impact analysis Integer programming Job shop scheduling Job shops Job-shop scheduling; flexible manufacturing system (FMS) Linear programming minimal time lags Mixed integer mixed-integer linear programming (MILP) mobile robots and automated guided vehicles (AGVs) Scheduling structure-based branch-and-bound (B&B)
ISSN:	0020-7543, 1366-588X
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	Current studies on scheduling of machines and transporters assume that either a single transporter or an infinite number of homogeneous transporters such as AGVs or mobile robots are available to transport semi-finished jobs, which seems very restrictive in practice. This paper addresses this gap by studying a job-shop scheduling problem that incorporates a limited number of heterogeneous transporters, where the objective is to minimize the makespan. The problem is modelled using mixed-integer linear programming and constraint programming. Different structure-based branch-and-bound algorithms with two lower-bounding strategies are also developed. A comprehensive numerical study evaluates the proposed models and algorithms. The research demonstrates that the adjustment of the proposed MILP model outperforms the existing formulation when applied to the homogeneous case. The study also uncovers interesting practical implications, including the analysis of the impact of different transporter types in the system. It shows that utilizing a fleet of heterogeneous transporters can improve the overall performance of the job shop compared to a relevant homogeneous case. The importance of the study is emphasized by highlighting the negative consequences of disregarding transporters' differences during the scheduling phase.
AbstractList	Current studies on scheduling of machines and transporters assume that either a single transporter or an infinite number of homogeneous transporters such as AGVs or mobile robots are available to transport semi-finished jobs, which seems very restrictive in practice. This paper addresses this gap by studying a job-shop scheduling problem that incorporates a limited number of heterogeneous transporters, where the objective is to minimize the makespan. The problem is modelled using mixed-integer linear programming and constraint programming. Different structure-based branch-and-bound algorithms with two lower-bounding strategies are also developed. A comprehensive numerical study evaluates the proposed models and algorithms. The research demonstrates that the adjustment of the proposed MILP model outperforms the existing formulation when applied to the homogeneous case. The study also uncovers interesting practical implications, including the analysis of the impact of different transporter types in the system. It shows that utilizing a fleet of heterogeneous transporters can improve the overall performance of the job shop compared to a relevant homogeneous case. The importance of the study is emphasized by highlighting the negative consequences of disregarding transporters' differences during the scheduling phase.
Author	Hooshangi-Tabrizi, Pedram Ahmadi-Javid, Amir Haghi, Maryam
Author_xml	– sequence: 1 givenname: Amir orcidid: 0000-0002-9132-6887 surname: Ahmadi-Javid fullname: Ahmadi-Javid, Amir email: ahmadi_javid@aut.ac.ir organization: Amirkabir University of Technology – sequence: 2 givenname: Maryam surname: Haghi fullname: Haghi, Maryam organization: HEC Montréal – sequence: 3 givenname: Pedram surname: Hooshangi-Tabrizi fullname: Hooshangi-Tabrizi, Pedram organization: Concordia University
BookMark	eNqFkN1KwzAYhoMoOH8uQQh4amfaNGmqJ8rwZzBRUMGzkKbpmtElM0kZuwMv29TpiQeagySE93nz8RyAXWONAuAkReMUMXSOUIYKkuNxhrK4ZRjlrNwBoxRTmhDG3nbBaMgkQ2gfHHi_QHERlo_Ax9QENXciqBoubJX41q6gl62q-06bOdQGCgNvH57hWocWtiooZ-fKKNt7GJwwfmVdfPMX8GE6e4KNdcu-E0FbcwalNT5mtAlwFSknlsvYeRYba1hFVrZJvCaV7U19BPYa0Xl1_H0egtfbm5fJfTJ7vJtOrmeJxCUJSapwVTJZVVkplCxYoXDOKC1IwRpCGWoykkuM6zzPiEwJLUTKJMWUMVZWUjB8CE63vXGi9175wBe2dyZ-yTFKcVnmZUZjimxT0lnvnWr4yumlcBueIj5I5z_S-SCdf0uP3OUvTurwZWPw0P1LX21pbQaPYm1dV_MgNp11zeBLxyH_rvgEPQ6dxA
CitedBy_id	crossref_primary_10_1080_00207543_2025_2550454 crossref_primary_10_1016_j_engappai_2025_111356 crossref_primary_10_1016_j_aei_2025_103195 crossref_primary_10_1080_03081079_2025_2548921 crossref_primary_10_1111_itor_70003 crossref_primary_10_1016_j_cie_2025_111465 crossref_primary_10_1080_00207543_2025_2511239 crossref_primary_10_1016_j_asoc_2025_112938 crossref_primary_10_1016_j_eswa_2025_129467 crossref_primary_10_1109_LRA_2025_3600104 crossref_primary_10_1016_j_cor_2025_107087 crossref_primary_10_1080_00207543_2024_2403766
Cites_doi	10.1080/00207543.2013.828164 10.1287/opre.43.6.1058 10.1057/palgrave.jors.2600769 10.1007/978-0-387-77778-8_1 10.1007/s00170-010-2820-2 10.1007/s11590-014-0761-7 10.1080/13528160412331326450 10.1287/opre.35.4.556 10.1080/07408179808966449 10.1016/j.asoc.2019.105520 10.1016/S0166-218X(01)00273-6 10.1016/S0166-218X(00)00316-4 10.1080/00207543.2021.1968526 10.1080/002075498193624 10.1007/s00170-005-0017-x 10.1016/j.omega.2017.05.010 10.1080/00207543.2022.2060772 10.1287/opre.44.5.777 10.1023/B:JOSH.0000036858.59787.c2 10.1007/s10898-021-00992-6 10.1007/s10846-021-01378-2 10.1080/00207543.2015.1087656 10.1016/j.rcim.2021.102283 10.1016/j.tre.2021.102273 10.1016/j.ijpe.2010.07.012 10.1111/itor.13108 10.1007/s10696-006-9028-7 10.1007/s10898-018-0681-7 10.1007/s00170-005-2529-9 10.1007/s00170-005-0223-6 10.1007/s00170-015-7329-2 10.1287/mnsc.32.7.890 10.1007/978-3-319-32552-1_53 10.1016/j.cie.2019.07.048 10.1007/s00170-009-2122-8 10.1007/s10951-021-00683-w 10.1016/j.ejor.2005.02.077 10.1016/j.ejor.2008.03.051 10.1016/j.cie.2016.02.024 10.1080/00207543.2019.1709671 10.1007/978-3-319-33625-1_1 10.1016/S0167-5060(08)70356-X 10.1016/j.cor.2017.09.018 10.1007/s00170-015-6981-x 10.1016/j.cor.2016.09.011 10.1007/s10732-018-9391-z 10.1007/s10878-014-9723-3 10.1016/j.cie.2021.107542 10.1080/00207543.2022.2053603 10.1016/0166-218X(94)90204-6 10.1108/01439911011063281 10.1016/j.cie.2015.01.003 10.1109/JAS.2019.1911540 10.1080/00207543.2021.2007310 10.1080/00207543.2017.1387302 10.1016/j.ejor.2015.07.020 10.1016/j.cor.2016.11.017 10.1080/00207543.2015.1035812 10.1007/s11771-011-0863-7 10.1016/j.ejor.2003.10.034 10.1080/0020754032000123579 10.1016/j.ejor.2004.12.023 10.1016/j.jclepro.2022.132551 10.1016/j.jmsy.2020.02.004 10.1016/S0305-0548(96)00061-5 10.1080/00207543.2021.1884309 10.1016/j.cor.2022.105731 10.1080/00207540600818286 10.1109/TASE.2021.3062979 10.1007/s10696-017-9302-x 10.1080/00207543.2021.2023777 10.1016/j.cor.2004.11.006
ContentType	Journal Article
Copyright	2023 Informa UK Limited, trading as Taylor & Francis Group 2023 2023 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml	– notice: 2023 Informa UK Limited, trading as Taylor & Francis Group 2023 – notice: 2023 Informa UK Limited, trading as Taylor & Francis Group
DBID	AAYXX CITATION 7SC 8FD F28 FR3 JQ2 L7M L~C L~D
DOI	10.1080/00207543.2023.2230489
DatabaseName	CrossRef Computer and Information Systems Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering 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 ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1366-588X
EndPage	3304
ExternalDocumentID	10_1080_00207543_2023_2230489 2230489
Genre	Research Article
GroupedDBID	-~X .7F .QJ 0BK 0R~ 29J 2DF 30N 4.4 5GY 5VS 8VB A8Z AAENE AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR ABCCY ABFIM ABHAV ABJNI ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACGEJ ACGFO ACGFS ACGOD ACIWK ACNCT ACTIO ADCVX ADGTB ADXPE AEGXH AEISY AEMOZ AENEX AEOZL AEPSL AEYOC AFKVX AFRVT AGDLA AGMYJ AHDZW AHQJS AIAGR AIJEM AIYEW AJWEG AKBVH AKOOK AKVCP ALMA_UNASSIGNED_HOLDINGS ALQZU AQRUH AQTUD AVBZW AWYRJ BLEHA CCCUG CE4 CS3 DGEBU DKSSO DU5 EBD EBE EBO EBR EBS EBU EMK EPL ESTFP E~A E~B GTTXZ H13 HF~ HZ~ H~9 H~P I-F IPNFZ J.P KYCEM LJTGL M4Z ML~ NA5 NX~ O9- P2P PQQKQ QWB RIG RNANH ROSJB RTWRZ S-T SNACF TASJS TBQAZ TDBHL TEN TFL TFT TFW TH9 TN5 TNC TTHFI TUROJ TWF UT5 UU3 ZGOLN ZL0 ~S~ AAYXX CITATION K1G 7SC 8FD F28 FR3 JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c395t-1e3b98cbb29aec787e348667578f5680f254c33d4425c1567a18c6368889bca83
IEDL.DBID	TFW
ISICitedReferencesCount	13
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001046603200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0020-7543
IngestDate	Wed Aug 13 10:05:01 EDT 2025 Sat Nov 29 05:36:25 EST 2025 Tue Nov 18 21:50:43 EST 2025 Mon Oct 20 23:46:46 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	9
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c395t-1e3b98cbb29aec787e348667578f5680f254c33d4425c1567a18c6368889bca83
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-9132-6887
PQID	3013994926
PQPubID	30924
PageCount	17
ParticipantIDs	informaworld_taylorfrancis_310_1080_00207543_2023_2230489 proquest_journals_3013994926 crossref_citationtrail_10_1080_00207543_2023_2230489 crossref_primary_10_1080_00207543_2023_2230489
PublicationCentury	2000
PublicationDate	2024-05-02
PublicationDateYYYYMMDD	2024-05-02
PublicationDate_xml	– month: 05 year: 2024 text: 2024-05-02 day: 02
PublicationDecade	2020
PublicationPlace	London
PublicationPlace_xml	– name: London
PublicationTitle	International journal of production research
PublicationYear	2024
Publisher	Taylor & Francis Taylor & Francis LLC
Publisher_xml	– name: Taylor & Francis – name: Taylor & Francis LLC
References	e_1_3_3_52_1 e_1_3_3_75_1 e_1_3_3_50_1 e_1_3_3_71_1 e_1_3_3_18_1 e_1_3_3_39_1 e_1_3_3_14_1 e_1_3_3_37_1 e_1_3_3_16_1 e_1_3_3_35_1 e_1_3_3_58_1 e_1_3_3_10_1 e_1_3_3_33_1 e_1_3_3_12_1 e_1_3_3_31_1 e_1_3_3_54_1 e_1_3_3_73_1 e_1_3_3_40_1 e_1_3_3_63_1 e_1_3_3_61_1 e_1_3_3_7_1 e_1_3_3_9_1 e_1_3_3_29_1 e_1_3_3_25_1 e_1_3_3_48_1 e_1_3_3_27_1 e_1_3_3_46_1 e_1_3_3_69_1 e_1_3_3_3_1 e_1_3_3_21_1 e_1_3_3_44_1 e_1_3_3_67_1 e_1_3_3_5_1 e_1_3_3_23_1 e_1_3_3_42_1 e_1_3_3_65_1 Pinedo M. (e_1_3_3_55_1) 2005 e_1_3_3_30_1 e_1_3_3_51_1 e_1_3_3_70_1 Raman N. (e_1_3_3_56_1) 1986 e_1_3_3_17_1 e_1_3_3_19_1 e_1_3_3_13_1 e_1_3_3_38_1 e_1_3_3_59_1 e_1_3_3_15_1 e_1_3_3_36_1 e_1_3_3_57_1 e_1_3_3_34_1 e_1_3_3_72_1 e_1_3_3_11_1 e_1_3_3_32_1 e_1_3_3_53_1 e_1_3_3_74_1 e_1_3_3_41_1 e_1_3_3_62_1 e_1_3_3_60_1 e_1_3_3_6_1 e_1_3_3_8_1 e_1_3_3_28_1 e_1_3_3_24_1 e_1_3_3_49_1 e_1_3_3_26_1 e_1_3_3_47_1 e_1_3_3_68_1 e_1_3_3_2_1 e_1_3_3_20_1 e_1_3_3_45_1 e_1_3_3_66_1 e_1_3_3_4_1 e_1_3_3_22_1 e_1_3_3_43_1 e_1_3_3_64_1
References_xml	– ident: e_1_3_3_75_1 doi: 10.1080/00207543.2013.828164 – volume-title: Planning and Scheduling in Manufacturing and Services year: 2005 ident: e_1_3_3_55_1 – ident: e_1_3_3_8_1 doi: 10.1287/opre.43.6.1058 – ident: e_1_3_3_57_1 doi: 10.1057/palgrave.jors.2600769 – ident: e_1_3_3_6_1 doi: 10.1007/978-0-387-77778-8_1 – ident: e_1_3_3_38_1 doi: 10.1007/s00170-010-2820-2 – ident: e_1_3_3_28_1 doi: 10.1007/s11590-014-0761-7 – ident: e_1_3_3_40_1 doi: 10.1080/13528160412331326450 – ident: e_1_3_3_41_1 doi: 10.1287/opre.35.4.556 – ident: e_1_3_3_61_1 doi: 10.1080/07408179808966449 – ident: e_1_3_3_54_1 doi: 10.1016/j.asoc.2019.105520 – ident: e_1_3_3_33_1 doi: 10.1016/S0166-218X(01)00273-6 – ident: e_1_3_3_32_1 doi: 10.1016/S0166-218X(00)00316-4 – ident: e_1_3_3_59_1 doi: 10.1080/00207543.2021.1968526 – ident: e_1_3_3_5_1 doi: 10.1080/002075498193624 – ident: e_1_3_3_16_1 doi: 10.1007/s00170-005-0017-x – ident: e_1_3_3_60_1 doi: 10.1016/j.omega.2017.05.010 – ident: e_1_3_3_71_1 doi: 10.1080/00207543.2022.2060772 – ident: e_1_3_3_19_1 doi: 10.1287/opre.44.5.777 – ident: e_1_3_3_74_1 doi: 10.1023/B:JOSH.0000036858.59787.c2 – ident: e_1_3_3_30_1 doi: 10.1007/s10898-021-00992-6 – ident: e_1_3_3_69_1 doi: 10.1007/s10846-021-01378-2 – ident: e_1_3_3_7_1 doi: 10.1080/00207543.2015.1087656 – ident: e_1_3_3_43_1 doi: 10.1016/j.rcim.2021.102283 – ident: e_1_3_3_66_1 doi: 10.1016/j.tre.2021.102273 – ident: e_1_3_3_39_1 doi: 10.1016/j.ijpe.2010.07.012 – ident: e_1_3_3_47_1 doi: 10.1111/itor.13108 – ident: e_1_3_3_21_1 doi: 10.1007/s10696-006-9028-7 – ident: e_1_3_3_23_1 doi: 10.1007/s10898-018-0681-7 – ident: e_1_3_3_35_1 doi: 10.1007/s00170-005-2529-9 – ident: e_1_3_3_58_1 doi: 10.1007/s00170-005-0223-6 – ident: e_1_3_3_68_1 doi: 10.1007/s00170-015-7329-2 – ident: e_1_3_3_12_1 doi: 10.1287/mnsc.32.7.890 – ident: e_1_3_3_53_1 doi: 10.1007/978-3-319-32552-1_53 – ident: e_1_3_3_63_1 doi: 10.1016/j.cie.2019.07.048 – ident: e_1_3_3_49_1 doi: 10.1007/s00170-009-2122-8 – start-page: 455 volume-title: Proceeding of the Second ORSA/TIMS Conference on Flexible Manufacturing Systems: Operations Research Models and Applications year: 1986 ident: e_1_3_3_56_1 – ident: e_1_3_3_29_1 doi: 10.1007/s10951-021-00683-w – ident: e_1_3_3_36_1 doi: 10.1016/j.ejor.2005.02.077 – ident: e_1_3_3_14_1 doi: 10.1016/j.ejor.2008.03.051 – ident: e_1_3_3_51_1 doi: 10.1016/j.cie.2016.02.024 – ident: e_1_3_3_27_1 doi: 10.1080/00207543.2019.1709671 – ident: e_1_3_3_50_1 doi: 10.1007/978-3-319-33625-1_1 – ident: e_1_3_3_25_1 doi: 10.1016/S0167-5060(08)70356-X – ident: e_1_3_3_26_1 doi: 10.1016/j.cor.2017.09.018 – ident: e_1_3_3_70_1 doi: 10.1007/s00170-015-6981-x – ident: e_1_3_3_46_1 doi: 10.1016/j.cor.2016.09.011 – ident: e_1_3_3_18_1 doi: 10.1007/s10732-018-9391-z – ident: e_1_3_3_11_1 doi: 10.1007/s10878-014-9723-3 – ident: e_1_3_3_9_1 doi: 10.1016/j.cie.2021.107542 – ident: e_1_3_3_65_1 doi: 10.1080/00207543.2022.2053603 – ident: e_1_3_3_10_1 doi: 10.1016/0166-218X(94)90204-6 – ident: e_1_3_3_48_1 doi: 10.1108/01439911011063281 – ident: e_1_3_3_62_1 doi: 10.1016/j.cie.2015.01.003 – ident: e_1_3_3_24_1 doi: 10.1109/JAS.2019.1911540 – ident: e_1_3_3_44_1 doi: 10.1080/00207543.2021.2007310 – ident: e_1_3_3_73_1 doi: 10.1080/00207543.2017.1387302 – ident: e_1_3_3_37_1 doi: 10.1016/j.ejor.2015.07.020 – ident: e_1_3_3_4_1 doi: 10.1016/j.cor.2016.11.017 – ident: e_1_3_3_3_1 doi: 10.1080/00207543.2015.1035812 – ident: e_1_3_3_15_1 doi: 10.1007/s11771-011-0863-7 – ident: e_1_3_3_34_1 doi: 10.1016/j.ejor.2003.10.034 – ident: e_1_3_3_2_1 doi: 10.1080/0020754032000123579 – ident: e_1_3_3_17_1 doi: 10.1016/j.ejor.2004.12.023 – ident: e_1_3_3_64_1 doi: 10.1016/j.jclepro.2022.132551 – ident: e_1_3_3_31_1 doi: 10.1016/j.jmsy.2020.02.004 – ident: e_1_3_3_67_1 doi: 10.1016/S0305-0548(96)00061-5 – ident: e_1_3_3_52_1 doi: 10.1080/00207543.2021.1884309 – ident: e_1_3_3_72_1 doi: 10.1016/j.cor.2022.105731 – ident: e_1_3_3_20_1 doi: 10.1080/00207540600818286 – ident: e_1_3_3_42_1 doi: 10.1109/TASE.2021.3062979 – ident: e_1_3_3_45_1 doi: 10.1007/s10696-017-9302-x – ident: e_1_3_3_13_1 doi: 10.1080/00207543.2021.2023777 – ident: e_1_3_3_22_1 doi: 10.1016/j.cor.2004.11.006
SSID	ssj0000584
Score	2.483725
Snippet	Current studies on scheduling of machines and transporters assume that either a single transporter or an infinite number of homogeneous transporters such as...
SourceID	proquest crossref informaworld
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	3288
SubjectTerms	AGVS Algorithms constraint programming (CP) Flexible manufacturing systems Impact analysis Integer programming Job shop scheduling Job shops Job-shop scheduling; flexible manufacturing system (FMS) Linear programming minimal time lags Mixed integer mixed-integer linear programming (MILP) mobile robots and automated guided vehicles (AGVs) Scheduling structure-based branch-and-bound (B&B)
Title	Integrated job-shop scheduling in an FMS with heterogeneous transporters: MILP formulation, constraint programming, and branch-and-bound
URI	https://www.tandfonline.com/doi/abs/10.1080/00207543.2023.2230489 https://www.proquest.com/docview/3013994926
Volume	62
WOSCitedRecordID	wos001046603200001&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: PRVAWR databaseName: Taylor and Francis Online Journals customDbUrl: eissn: 1366-588X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000584 issn: 0020-7543 databaseCode: TFW dateStart: 19610101 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8QwEA4iHvTgW3yTg0eztJtsNvEm4qLgLgsqeitNmrKKtrKt_gZ_tjNtuu4isge9tYcZ0nQyjzDzfYScSOOSQJiQdcO0y4R0MYt1oJgzykA4cC50piKb6A4G6vFRD303YeHbKrGGTmugiMpX4-GOTdF0xOEENwQ6wVtI_d1q47WmwhE-yOyxqe-u9_DtizvK4zAHDEWaGZ7ftMxEpxns0h--ugpAvbV_WPo6WfXZJz2vzWWDLLhsk6xMYRJukc_rBkAioc-5YcUof6NQAkNIwsl1-pTROKO9_i3FK1w6wnaaHKzQ5e8FLSdQ6ePijPavb4YUv81ThJ1Si9koklKU1DeGvYLOU9CYUIMUHyMGj8wg19M2ue9d3l1cMU_XwCzXnZKFjhutrDFtHTsLjsBxoaREwPy0I1WQQi1qOU8EuAkLZWM3DpWVXEINro2NFd8hi1meuV1ClWtbnRhlgzARPJXaSGO14jKGAk8Ju0dE85si67HMcfUvUTiBPK03OsKNjvxG75HWROytBvOYJ6CnbSAqq1uUtKY8ifgc2cPGYCLvF0AEM26NII37f1B9QJbhVVR9l-1DsliO390RWbIf5VMxPq5OwBd3hQGr
linkProvider	Taylor & Francis
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3dS8MwEA86BfXBb3F-5sHHZbRLlia-iTg23IbgxL2VJk3ZRFvZqn-Df7a5fsyJyB70rVDuSNPLXe64-_0QuuDKhA5TLvHcyCOMm4AE0hHEKKFsODDGNSojm_D6fTEcyvlZGGirhBw6yoEiMl8NhxuK0WVLHIxw20jHaB24v-sNqGsKuYxWgJ0OErBB6_HLGzdFgcTsEJApp3h-U_MtPn1DL_3hrbMQ1Nr6j8Vvo83iAoqvcovZQUsm3kUbc7CEe-ijU2JIhPgpUWQ6Sl6xzYJtVILhdTyOcRDjVu8eQxUXj6CjJrGGaJK3KU5naOmT6SXudbp3GD6uYAmrYQ0XUuClSHHRG_ZiddasxhArYPkYEftIFNA97aOH1s3guk0KxgaiqWymxDVUSaGVasjAaOsLDGWCc8DMj5pcOJFNRzWlIbOeQtvM0QtcoTnlNg2XSgeCHqBKnMTmEGFhGlqGSmjHDRmNuFRcaSkoD2yOJ5iuIlb-J18XcOaw-mffnaGe5hvtw0b7xUZXUX0m9prjeSwSkPNG4KdZISXKWU98ukD2pLQYv3ANVgQu3RJwGo_-oPocrbUHva7f7fRvj9G6fcWyNszGCaqkkzdzilb1ezqeTs6y4_AJtm4Fzg
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT9wwELYooAoOUFoQz9YHjniVrL1emxsCIlbAaiWoyi2KHUcLgmS1CfwGfjYzibMFIcShvUWKZuQ443lYM99HyL40Lg2ECVk_zPpMSJewRAeKOaMMhAPnQmdqson-cKhubvTIdxOWvq0Sa-isAYqofTUe7kmatR1xOMENgU7wDlJ_d7p4ran0F7IAqXMPDfs6-vPXGfeUB2IOGMq0QzwfqXkTnt6Al75z1nUEilb_w9q_kRWfftKjxl7WyJzLv5PlV6CEP8jzoEWQSOldYVg5LiYUamCISTi6Tm9zmuQ0uryieIdLx9hPU4AZuuKxpNUMK31aHtLLwcWI4rd5jrADajEdRVaKivrOsAfQeQAaU2qQ42PM4JEZJHtaJ7-j0-vjM-b5Gpjlulex0HGjlTWmqxNnwRM4LpSUiJif9aQKMihGLeepAD9hoW7sJ6GykksowrWxieIbZD4vcrdJqHJdq1OjbBCmgmdSG2msVlwmUOEpYbeIaH9TbD2YOa7-Pg5nmKfNRse40bHf6C3SmYlNGjSPzwT0axuIq_oaJWs4T2L-iexuazCxdwwggim3RpTG7X9Q_Yt8HZ1E8cVgeL5DluCNqHswu7tkvpo-uj2yaJ-q23L6sz4ML5T5BIA
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=Integrated+job-shop+scheduling+in+an+FMS+with+heterogeneous+transporters%3A+MILP+formulation%2C+constraint+programming%2C+and+branch-and-bound&rft.jtitle=International+journal+of+production+research&rft.au=Ahmadi-Javid%2C+Amir&rft.au=Haghi%2C+Maryam&rft.au=Hooshangi-Tabrizi%2C+Pedram&rft.date=2024-05-02&rft.pub=Taylor+%26+Francis+LLC&rft.issn=0020-7543&rft.eissn=1366-588X&rft.volume=62&rft.issue=9&rft.spage=3288&rft.epage=3304&rft_id=info:doi/10.1080%2F00207543.2023.2230489&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7543&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7543&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7543&client=summon