Balancing and scheduling of flexible mixed model assembly lines

Mixed model assembly line literature involves two problems: balancing and model sequencing. The general tendency in current studies is to deal with these problems in different time frames. However, in today’s competitive market, the mixed model assembly line balancing problem has been turned into an...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Constraints : an international journal Ročník 18; číslo 3; s. 434 - 469
Hlavní autoři:	Öztürk, Cemalettin, Tunalı, Semra, Hnich, Brahim, Örnek, M. Arslan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.07.2013 Springer
Témata:	Application Applied sciences Artificial Intelligence Computer Science Exact sciences and technology Firm modelling Inventory control, production control. Distribution Mathematical programming Operational research and scientific management Operational research. Management science Operations Research/Decision Theory Optimization Scheduling, sequencing Balancing Constraint programming Mixed integer programming Scheduling Decomposition Mixed model assembly lines Sequencing Assembly line Empirical method Constraint satisfaction Buffer system Modeling Constrained optimization Production management Economic market Product structure Flexible manufacturing system Capacity constraint Open market
ISSN:	1383-7133, 1572-9354
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	Mixed model assembly line literature involves two problems: balancing and model sequencing. The general tendency in current studies is to deal with these problems in different time frames. However, in today’s competitive market, the mixed model assembly line balancing problem has been turned into an operational problem. In this paper, we propose mixed integer programming (MIP) and constraint programming (CP) models which consider both balancing and model sequencing within the same formulation along with the optimal schedule of tasks at a station. Furthermore, we also compare the proposed exact models with decomposition schemes developed for solving different instances of varying sizes. This is the first paper in the literature which takes into account the network type precedence diagrams and limited buffer capacities between stations. Besides, it is the first study that CP method is applied to balancing and scheduling of mixed model assembly lines. Our empirical study shows that the CP approach outperforms the MIP approach as well as the decomposition schemes.
AbstractList	Mixed model assembly line literature involves two problems: balancing and model sequencing. The general tendency in current studies is to deal with these problems in different time frames. However, in today’s competitive market, the mixed model assembly line balancing problem has been turned into an operational problem. In this paper, we propose mixed integer programming (MIP) and constraint programming (CP) models which consider both balancing and model sequencing within the same formulation along with the optimal schedule of tasks at a station. Furthermore, we also compare the proposed exact models with decomposition schemes developed for solving different instances of varying sizes. This is the first paper in the literature which takes into account the network type precedence diagrams and limited buffer capacities between stations. Besides, it is the first study that CP method is applied to balancing and scheduling of mixed model assembly lines. Our empirical study shows that the CP approach outperforms the MIP approach as well as the decomposition schemes.
Author	Örnek, M. Arslan Hnich, Brahim Öztürk, Cemalettin Tunalı, Semra
Author_xml	– sequence: 1 givenname: Cemalettin surname: Öztürk fullname: Öztürk, Cemalettin organization: Department of Industrial Systems Engineering, İzmir University of Economics – sequence: 2 givenname: Semra surname: Tunalı fullname: Tunalı, Semra organization: Department of Business Administration, İzmir University of Economics – sequence: 3 givenname: Brahim surname: Hnich fullname: Hnich, Brahim email: hnich.brahim@gmail.com organization: Department of Computer Engineering, İzmir University of Economics – sequence: 4 givenname: M. Arslan surname: Örnek fullname: Örnek, M. Arslan organization: Department of Industrial Systems Engineering, İzmir University of Economics
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27580438$$DView record in Pascal Francis
BookMark	eNp9kDFPwzAQhS1UJNrCD2DLwmg4x06cTAgqCkiVWGC2HOdcUjlOZadS--9JFMTA0OnupPfe3X0LMvOdR0JuGdwzAPkQGeTAKDBOSyZSml-QOctkSkueidnQ84JTyTi_IosYdwBQSi7m5PFZO-1N47eJ9nUSzTfWBzeOnU2sw2NTOUza5oh10nY1ukTHiG3lTsmgwnhNLq12EW9-65J8rV8-V2908_H6vnraUMNZ0dOMiyqXNRgEjpxbLYTQ0uqirEqTgrbCmKwS0qRVlhcG0wpAM4M8r60sec6X5G7K3etotLNhPDqqfWhaHU4qlVkBYvhxSdikM6GLMaD9kzBQIyk1kVIDKTWSUmO2_OcxTa_7pvN90I0760wnZxy2-C0GtesOwQ8gzph-APYKfsU
CODEN	CNSTFT
CitedBy_id	crossref_primary_10_1080_00207543_2025_2509151 crossref_primary_10_1080_0305215X_2020_1716746 crossref_primary_10_1007_s10601_017_9279_9 crossref_primary_10_1016_j_cie_2024_110357 crossref_primary_10_1007_s00500_021_05921_z crossref_primary_10_1016_j_jmsy_2015_05_004 crossref_primary_10_1007_s12351_020_00563_9 crossref_primary_10_1080_00207543_2016_1223897 crossref_primary_10_1016_j_omega_2019_04_006 crossref_primary_10_1007_s00500_023_09105_9 crossref_primary_10_1080_00207543_2019_1598597 crossref_primary_10_1016_j_ijpe_2018_06_012 crossref_primary_10_4028_www_scientific_net_AMM_670_671_1593 crossref_primary_10_1007_s00500_021_05602_x crossref_primary_10_1007_s10100_019_00642_z crossref_primary_10_1007_s10845_023_02292_0 crossref_primary_10_1080_0305215X_2017_1351963 crossref_primary_10_1016_j_jmsy_2019_01_001 crossref_primary_10_1007_s00500_019_04294_8 crossref_primary_10_1016_j_procir_2021_11_023 crossref_primary_10_1016_j_jmsy_2023_01_001 crossref_primary_10_1080_00207543_2018_1470341 crossref_primary_10_1080_00207543_2019_1581954 crossref_primary_10_1016_j_apm_2013_05_049 crossref_primary_10_1016_j_ejor_2016_11_027 crossref_primary_10_1016_j_cie_2016_11_001 crossref_primary_10_1016_j_cor_2019_104863 crossref_primary_10_3233_IFS_151854 crossref_primary_10_1080_08839514_2020_1731782 crossref_primary_10_1007_s00170_014_6153_4 crossref_primary_10_1080_00207543_2022_2152890
Cites_doi	10.1080/03052150801982509 10.1016/j.ejor.2005.02.077 10.1007/978-1-4615-1479-4 10.1016/j.ejor.2006.07.044 10.1016/S1574-6526(06)80015-5 10.1023/A:1013653332557 10.1016/S0377-2217(02)00764-6 10.1080/00207540701223410 10.1080/095372800750038355 10.1016/S0377-2217(98)00364-6 10.1287/ijoc.14.4.387.2830 10.1007/978-3-540-74472-6_65 10.1023/A:1014434117888 10.1016/S0377-2217(02)00795-6 10.1007/978-3-540-45226-3_180 10.1017/S0269888901000042 10.1016/0004-3702(80)90051-X 10.1080/002075499190545 10.1007/s00291-006-0070-3 10.1016/j.ejor.2004.07.032 10.1023/A:1014440424150 10.1023/A:1008067422364 10.1023/A:1026568011013 10.1023/A:1018916608787 10.1080/002075400418252 10.1080/09537280903011626 10.1287/mnsc.47.3.480.9777 10.1080/00207540802577979 10.1016/j.ejor.2007.09.013 10.1287/ijoc.13.4.258.9733 10.1007/978-3-662-11223-6 10.1016/S1474-6670(17)37738-8 10.1016/S1574-6526(06)80010-6 10.1016/j.engappai.2009.07.002 10.1080/00207540903117857 10.1016/j.ijpe.2007.02.026 10.1287/ijoc.14.4.322.2825 10.1016/0895-7177(93)90068-A 10.1145/359496.359529 10.1007/s10951-009-0144-6 10.1287/ijoc.14.4.345.2826 10.1007/s00291-011-0265-0 10.1080/00207540903140750 10.1016/S0377-2217(01)00328-9
ContentType	Journal Article
Copyright	Springer Science+Business Media New York 2013 2014 INIST-CNRS
Copyright_xml	– notice: Springer Science+Business Media New York 2013 – notice: 2014 INIST-CNRS
DBID	AAYXX CITATION IQODW
DOI	10.1007/s10601-013-9142-6
DatabaseName	CrossRef Pascal-Francis
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences
EISSN	1572-9354
EndPage	469
ExternalDocumentID	27580438 10_1007_s10601_013_9142_6
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C .86 .VR 06D 0VY 1N0 1SB 2.D 203 28- 29F 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAK LLZTM M4Y MA- N2Q NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P9O PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RNI ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7X Z83 Z88 Z8M Z8R Z8W Z92 ZMTXR ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION IQODW
ID	FETCH-LOGICAL-c318t-534b67d0ce03e33fa444a7fa89b9c20af4cc5b47c2b568ce2b00a1ce36df79363
IEDL.DBID	RSV
ISICitedReferencesCount	35
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000317978200005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1383-7133
IngestDate	Mon Jul 21 09:13:28 EDT 2025 Sat Nov 29 04:16:03 EST 2025 Tue Nov 18 22:01:37 EST 2025 Fri Feb 21 02:33:35 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	Balancing Constraint programming Mixed integer programming Scheduling Decomposition Mixed model assembly lines Sequencing Assembly line Empirical method Constraint satisfaction Buffer system Modeling Constrained optimization Production management Economic market Product structure Flexible manufacturing system Capacity constraint Open market
Language	English
License	http://www.springer.com/tdm CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c318t-534b67d0ce03e33fa444a7fa89b9c20af4cc5b47c2b568ce2b00a1ce36df79363
PageCount	36
ParticipantIDs	pascalfrancis_primary_27580438 crossref_primary_10_1007_s10601_013_9142_6 crossref_citationtrail_10_1007_s10601_013_9142_6 springer_journals_10_1007_s10601_013_9142_6
PublicationCentury	2000
PublicationDate	2013-07-01
PublicationDateYYYYMMDD	2013-07-01
PublicationDate_xml	– month: 07 year: 2013 text: 2013-07-01 day: 01
PublicationDecade	2010
PublicationPlace	Boston
PublicationPlace_xml	– name: Boston – name: Heidelberg
PublicationSubtitle	An International Journal
PublicationTitle	Constraints : an international journal
PublicationTitleAbbrev	Constraints
PublicationYear	2013
Publisher	Springer US Springer
Publisher_xml	– name: Springer US – name: Springer
References	PinedoMLScheduling theory, algorithms, and systems20083New YorkSpringer1155.90008 HentenryckPConstraint satisfaction in logic programming1989CambridgeMIT Press SchollABoysenNFliednerMThe sequence-dependent assembly line balancing problemOR Spectrum200830357960923995081193.9023510.1007/s00291-006-0070-3 Dincbas, M., Simonis, H., van Hentenryck, P. (1988). Solving the car-sequencing problem in constraint logic programming. In Proceedings of the European conference on artificial intelligence (ECAI-88) (pp. 290–295). München. AkgündüzOSTunalıSAn adaptive genetic algorithm approach for the mixed-model assembly line sequencing problemInternational Journal of Production Research200948175157517910.1080/00207540903117857 Baptiste, P., & Le Pape, C. (1996). Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. In Proceedings of the fifteenth workshop of the UK planning special interest group. Liverpool. BrailsfardSCPottsCNSmithBMConstraint satisfaction problems: algorithms and applicationsEuropean Journal of Operational Research199911955758110.1016/S0377-2217(98)00364-6 JainVGrossmannIEAlgorithms for Hybrid MILP/CP Models for a Class of Optimization ProblemsINFORMS Journal on Computing200113425827618698801238.9010610.1287/ijoc.13.4.258.9733 Davenport, A., Gefflot, C., Beck, J. (2001). Slack-based techniques for robust schedules. In Proceedings of 6th European conference on planning (ECP-01). PugetJFLustigIConstraint programming and maths programmingKnowledge Engineering Review20011615230994.9013310.1017/S0269888901000042 Bockmayr, A., & Pisaruk, N. (2001). Solving an assembly line balancing problem by combining IP and CP. In Proceedings of the 6th annual workshop of ERCIM working droup on constraints. Prague, Czech Republic. MartinoLPastorRHeuristic procedures for solving the general assembly line balancing problem with setupsInternational Journal of Production Research20104861787180410.1080/00207540802577979 HoeveWKatrielIRossiFvan BeekPWalshTGlobal ConstraintsHandbook of constraint programming2006AmsterdamElsevier Science16920810.1016/S1574-6526(06)80010-6 AgnetisAArbibCConcurrent operations assignment and sequencing for particular assembly problems in flow linesAnnals of Operation Research1997691310880.9006810.1023/A:1018916608787 KhayatGELangevinARiopelDIntegrated production and material handling scheduling using mathematical programming and constraint programmingEuropean Journal of Operations Research2006175181818321142.9037110.1016/j.ejor.2005.02.077 Regin, J.C. (1994). A filtering algorithm for constraints of difference in CSPs (AAAI-94) (pp. 362–367). Washington. MiltenburgJBalancing and scheduling mixed-model U-shaped production linesInternational Journal of Flexible Manufacturing Systems20021411915110.1023/A:1014434117888 ZeballosLJQuirogaODHenningGPA constraint programming model for the scheduling of flexible manufacturing systems with machine and tool limitationsEngineering Applications of Artificial Intelligence20102322924810.1016/j.engappai.2009.07.002 OttossonGThorsteinssonESHookerJNMixed global constraints and inference in hybrid CLP-IP solversAnnals of Mathematics and Artificial Intelligence200234427129018961061026.9006210.1023/A:1014440424150 MilanoMOttossonGRefaloPThorsteinssonESThe role of integer programming techniques in constraint programming’s global constraintsINFORMS Journal on Computing200214438740219462971238.9010110.1287/ijoc.14.4.387.2830 BoysenNFliednerMSchollAProduction planning of mixed-model assembly lines: overview and extensionsProduction Planning & Control200920545547110.1080/09537280903011626 HentenryckPPerronLPugetJFSearch and strategies in OPLACM Transactions on Computational Logic200012285320185892610.1145/359496.359529 KimYKKimJYKimYAn endosymbiotic evolutionary algorithm for the integration of balancing and sequencing in mixed-model U-linesEuropean Journal of Operational Research200616883885221696141083.9001610.1016/j.ejor.2004.07.032 Scholl, A., Boysen, N., Fliedner, M. (2011). The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics. OR Spectrum. doi:10.1007/s00291-011-0265-0. MilanoMWallaceMIntegrating operations research in constraint programmingOR2006417521922620881125.90392 YavuzMAkcaliEProduction smoothing in just-in-time manufacturing systems: a review of the models and solution approachesInternational Journal of Production Research20074516357935971160.9046410.1080/00207540701223410 KarabatıSSayınSAssembly line balancing in a mixed-model sequencing environment with synchronous transfersEuropean Journal of Operational Research200314941742919931421103.6811710.1016/S0377-2217(02)00764-6 AndresCMirallesCPastorRBalancing and scheduling tasks in assembly lines with sequenc-dependent setup timesEuropean Journal of Operational Research2008187121212231137.9047610.1016/j.ejor.2006.07.044 HaralickRMElliottGLIncreasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence19801426331410.1016/0004-3702(80)90051-X Laborie, P., Rogerie, J., Shaw, P., Vilím, P. (2009). Reasoning with conditional time-intervals, Part II: An algebraical model for resources. In Proc. 22th international FLAIRS conference (FLAIRS 2009) (pp. 201–206). HentenryckPConstraint and integer programming in OPLINFORMS Journal on Computing200214434537219462951238.9010210.1287/ijoc.14.4.345.2826 Laborie, P., & Rogerie, J. (2008). Reasoning with conditional time-intervals. In Proc. 21th international FLAIRS conference (FLAIRS 2008) (pp. 555–560). Appa, G., Mourtos, I., Magos, D. (2002). Integrating constraint and integers programming for the orthogonal latin squares problem, principles and practice of constraint programming - CP 2002 (pp. 79–90). Springer. SawikTLoading and Scheculing of a flexible assembly system by mixed integer programmingEuropean Journal of Operational Research200415411920256570176.1330110.1016/S0377-2217(02)00795-6 ILOG (2003). OPL Studio 3.7. Language Manual. Aggoun, A., & Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems (Mathl. Comput. Modelling) (vol. 17, no. 7, pp. 57–73). Pergamon Press Ltd. KrogtRGeraghtyJSalmanMRLittleJOn supporting Lean methodologies using constraint-based schedulingJournal of Scheduling20101330131410.1007/s10951-009-0144-6 FocacciFLodiAMilanoMMathematical programming techniques in constraint programming: A short overviewJournal of Heuristics200287171073.9003510.1023/A:1013653332557 ÖzcanUTokluBBalancing two-sided assembly lines with sequence-dependent setup timesInternational Journal of Production Research200948185363538310.1080/00207540903140750 WilhelmWEA column-generation approach for the assembly system design problem with tool changesInternational Journal of Flexible Manufacturing Systems199911177205168813010.1023/A:1008067422364 MerengoCNavaFPozzettiABalancing and sequencing manual mixed-model assembly linesInternational Journal of Production Research19993712283528600949.9057010.1080/002075499190545 SawikTMonolithic vs. hierarchical balancing and scheduling of a flexible assembly lineEuropean Journal of Operational Research200214311512419226241073.9051410.1016/S0377-2217(01)00328-9 Laborie, P., & Godard, D. (2007). Self-adapting large neighbourhood search: Application to single-mode scheduling problems. In Proc. of the 3rd multidisciplinary international conference on scheduling: Theory and applications (MISTA) (pp. 276–284). BoysenNFliednerMSchollASequencing mixed-model assembly lines: Survey, classification and model crituqeEuropean Journal of Operational Research200919234977324547681157.9040510.1016/j.ejor.2007.09.013 FourerRGayDMExtending an algebraic modeling language to support constraint programmingINFORMS Journal on Computing200214432234419462941238.9011310.1287/ijoc.14.4.322.2825 DrexlAKimmsASequencing JIT mixed-model assembly lines under station-load and part-usage constraintsManagement Science20014734804911232.9011010.1287/mnsc.47.3.480.9777 Özdemir, R.G., Ayaǧ, Z., Çakır, D. (2004). Hazırlık sürelerinin azaltılması için bir hat dengeleme modeli (YA/EM 2004). Kocaeli. PastorRFerrerLGarciaAEvaluating optimization models to solve SALBPLecture Notes in Computer Science20072007470579180310.1007/978-3-540-74472-6_65 Policella, N., Cesta, A., Oddi, A., Smith, S. (2004). Generating robust schedules through temporal flexibility. In Proc. ICAPS 04. BaptistePLe PapeCNuijtenWConstraint-Based Scheduling2001BostonKluwer Academic Publishers1094.9000210.1007/978-1-4615-1479-4 BoysenNFliednerMSchollAAssembly line balancing: Which model to use whenInternational Journal of Production Economics200811150952810.1016/j.ijpe.2007.02.026 KimYKKimJYKimYA coevolutionary algorithm for balancing and sequencing in mixed model assembly linesApplied Intelligence20001324725810.1023/A:1026568011013 SawikTSimultaneous vs. sequential loading and scheduling of flexible assembly systemsInternational Journal of Production Research200038326732821094.9056310.1080/002075400418252 Gao, H. (1995). Building robust schedules using temporal protection protection-an empirical study of constraint based scheduling under machine failure uncertainty. Master’s thesis, Department of Industrial Engineering, University of Toronto. ValleCDMarquezAAGascaRMToroMOn selecting and scheduling assembly plans using constraint programmingLecture notes in computer science2003200327741329133610.1007/978-3-540-45226-3_180 SchollABalancing and sequencing assembly lines19992HeidelbergPhysica SmithBRossiFvan BeekPWalshTModellingHandbook of constraint programming2006AmsterdamElsevier Science37740610.1016/S1574-6526(06)80015-5 Bartak, R. (2003). Constraint-based scheduling: An introduction for newcomers. Intelligent manufacturing systems 2003 (pp. 69–75). KaraYLine balancing and model sequencing to reduce work overload in mixed-model U-line production environmentsEngineering Optimization2008407669684243762010.1080/03052150801982509 KimYKKimSJKimJYBalancing and sequencing mixed-mode P Hentenryck (9142_CR24) 1989 OS Akgündüz (9142_CR3) 2009; 48 T Sawik (9142_CR53) 2002; 143 9142_CR51 N Boysen (9142_CR12) 2009; 20 P Hentenryck (9142_CR22) 2002; 14 W Hoeve (9142_CR26) 2006 9142_CR18 9142_CR15 9142_CR14 9142_CR57 CD Valle (9142_CR59) 2003; 2003 9142_CR4 A Agnetis (9142_CR2) 1997; 69 9142_CR6 9142_CR1 R Pastor (9142_CR47) 2007; 2007 T Sawik (9142_CR54) 2004; 154 N Boysen (9142_CR11) 2009; 192 J Miltenburg (9142_CR43) 2002; 14 R Fourer (9142_CR19) 2002; 14 A Drexl (9142_CR16) 2001; 47 Y Kara (9142_CR29) 2008; 40 9142_CR20 S Karabatı (9142_CR30) 2003; 149 A Scholl (9142_CR56) 2008; 30 V Jain (9142_CR28) 2001; 13 RM Haralick (9142_CR21) 1980; 14 9142_CR27 9142_CR25 GE Khayat (9142_CR31) 2006; 175 U Özcan (9142_CR45) 2009; 48 M Yavuz (9142_CR61) 2007; 45 A Scholl (9142_CR55) 1999 M Milano (9142_CR42) 2002; 14 YK Kim (9142_CR32) 2000; 13 JF Puget (9142_CR50) 2001; 16 F Focacci (9142_CR17) 2002; 8 SC Brailsfard (9142_CR13) 1999; 119 C Merengo (9142_CR40) 1999; 37 M Milano (9142_CR41) 2006; 4 9142_CR38 9142_CR37 9142_CR9 9142_CR36 9142_CR8 YK Kim (9142_CR34) 2006; 168 ML Pinedo (9142_CR48) 2008 R Krogt (9142_CR35) 2010; 13 G Ottosson (9142_CR44) 2002; 34 P Baptiste (9142_CR7) 2001 B Smith (9142_CR58) 2006 YK Kim (9142_CR33) 2000; 11 N Boysen (9142_CR10) 2008; 111 L Martino (9142_CR39) 2010; 48 9142_CR49 WE Wilhelm (9142_CR60) 1999; 11 T Sawik (9142_CR52) 2000; 38 9142_CR46 C Andres (9142_CR5) 2008; 187 P Hentenryck (9142_CR23) 2000; 1 LJ Zeballos (9142_CR62) 2010; 23
References_xml	– reference: KarabatıSSayınSAssembly line balancing in a mixed-model sequencing environment with synchronous transfersEuropean Journal of Operational Research200314941742919931421103.6811710.1016/S0377-2217(02)00764-6 – reference: ÖzcanUTokluBBalancing two-sided assembly lines with sequence-dependent setup timesInternational Journal of Production Research200948185363538310.1080/00207540903140750 – reference: DrexlAKimmsASequencing JIT mixed-model assembly lines under station-load and part-usage constraintsManagement Science20014734804911232.9011010.1287/mnsc.47.3.480.9777 – reference: Laborie, P., & Godard, D. (2007). Self-adapting large neighbourhood search: Application to single-mode scheduling problems. In Proc. of the 3rd multidisciplinary international conference on scheduling: Theory and applications (MISTA) (pp. 276–284). – reference: SchollABalancing and sequencing assembly lines19992HeidelbergPhysica – reference: AgnetisAArbibCConcurrent operations assignment and sequencing for particular assembly problems in flow linesAnnals of Operation Research1997691310880.9006810.1023/A:1018916608787 – reference: Bartak, R. (2003). Constraint-based scheduling: An introduction for newcomers. Intelligent manufacturing systems 2003 (pp. 69–75). – reference: SawikTLoading and Scheculing of a flexible assembly system by mixed integer programmingEuropean Journal of Operational Research200415411920256570176.1330110.1016/S0377-2217(02)00795-6 – reference: FocacciFLodiAMilanoMMathematical programming techniques in constraint programming: A short overviewJournal of Heuristics200287171073.9003510.1023/A:1013653332557 – reference: Scholl, A., Boysen, N., Fliedner, M. (2011). The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics. OR Spectrum. doi:10.1007/s00291-011-0265-0. – reference: Hentenryck, P., Carillon, J.P. (1988). Generality versus specificity: An experience with AI and OR techniques (AAAI-88, 1988) (pp. 660–664). Minnesota. – reference: MiltenburgJBalancing and scheduling mixed-model U-shaped production linesInternational Journal of Flexible Manufacturing Systems20021411915110.1023/A:1014434117888 – reference: AkgündüzOSTunalıSAn adaptive genetic algorithm approach for the mixed-model assembly line sequencing problemInternational Journal of Production Research200948175157517910.1080/00207540903117857 – reference: Aggoun, A., & Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems (Mathl. Comput. Modelling) (vol. 17, no. 7, pp. 57–73). Pergamon Press Ltd. – reference: Policella, N., Cesta, A., Oddi, A., Smith, S. (2004). Generating robust schedules through temporal flexibility. In Proc. ICAPS 04. – reference: ValleCDMarquezAAGascaRMToroMOn selecting and scheduling assembly plans using constraint programmingLecture notes in computer science2003200327741329133610.1007/978-3-540-45226-3_180 – reference: KimYKKimSJKimJYBalancing and sequencing mixed-model U-lines with a co-evolutionary algorithmProduction Planning & Control20001175476410.1080/095372800750038355 – reference: HaralickRMElliottGLIncreasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence19801426331410.1016/0004-3702(80)90051-X – reference: SawikTSimultaneous vs. sequential loading and scheduling of flexible assembly systemsInternational Journal of Production Research200038326732821094.9056310.1080/002075400418252 – reference: YavuzMAkcaliEProduction smoothing in just-in-time manufacturing systems: a review of the models and solution approachesInternational Journal of Production Research20074516357935971160.9046410.1080/00207540701223410 – reference: Gao, H. (1995). Building robust schedules using temporal protection protection-an empirical study of constraint based scheduling under machine failure uncertainty. Master’s thesis, Department of Industrial Engineering, University of Toronto. – reference: MilanoMWallaceMIntegrating operations research in constraint programmingOR2006417521922620881125.90392 – reference: BoysenNFliednerMSchollAProduction planning of mixed-model assembly lines: overview and extensionsProduction Planning & Control200920545547110.1080/09537280903011626 – reference: KrogtRGeraghtyJSalmanMRLittleJOn supporting Lean methodologies using constraint-based schedulingJournal of Scheduling20101330131410.1007/s10951-009-0144-6 – reference: MilanoMOttossonGRefaloPThorsteinssonESThe role of integer programming techniques in constraint programming’s global constraintsINFORMS Journal on Computing200214438740219462971238.9010110.1287/ijoc.14.4.387.2830 – reference: WilhelmWEA column-generation approach for the assembly system design problem with tool changesInternational Journal of Flexible Manufacturing Systems199911177205168813010.1023/A:1008067422364 – reference: KaraYLine balancing and model sequencing to reduce work overload in mixed-model U-line production environmentsEngineering Optimization2008407669684243762010.1080/03052150801982509 – reference: HentenryckPPerronLPugetJFSearch and strategies in OPLACM Transactions on Computational Logic200012285320185892610.1145/359496.359529 – reference: OttossonGThorsteinssonESHookerJNMixed global constraints and inference in hybrid CLP-IP solversAnnals of Mathematics and Artificial Intelligence200234427129018961061026.9006210.1023/A:1014440424150 – reference: BrailsfardSCPottsCNSmithBMConstraint satisfaction problems: algorithms and applicationsEuropean Journal of Operational Research199911955758110.1016/S0377-2217(98)00364-6 – reference: JainVGrossmannIEAlgorithms for Hybrid MILP/CP Models for a Class of Optimization ProblemsINFORMS Journal on Computing200113425827618698801238.9010610.1287/ijoc.13.4.258.9733 – reference: Laborie, P., Rogerie, J., Shaw, P., Vilím, P. (2009). Reasoning with conditional time-intervals, Part II: An algebraical model for resources. In Proc. 22th international FLAIRS conference (FLAIRS 2009) (pp. 201–206). – reference: HentenryckPConstraint satisfaction in logic programming1989CambridgeMIT Press – reference: Dincbas, M., Simonis, H., van Hentenryck, P. (1988). Solving the car-sequencing problem in constraint logic programming. In Proceedings of the European conference on artificial intelligence (ECAI-88) (pp. 290–295). München. – reference: Appa, G., Mourtos, I., Magos, D. (2002). Integrating constraint and integers programming for the orthogonal latin squares problem, principles and practice of constraint programming - CP 2002 (pp. 79–90). Springer. – reference: PugetJFLustigIConstraint programming and maths programmingKnowledge Engineering Review20011615230994.9013310.1017/S0269888901000042 – reference: ZeballosLJQuirogaODHenningGPA constraint programming model for the scheduling of flexible manufacturing systems with machine and tool limitationsEngineering Applications of Artificial Intelligence20102322924810.1016/j.engappai.2009.07.002 – reference: HoeveWKatrielIRossiFvan BeekPWalshTGlobal ConstraintsHandbook of constraint programming2006AmsterdamElsevier Science16920810.1016/S1574-6526(06)80010-6 – reference: Davenport, A., Gefflot, C., Beck, J. (2001). Slack-based techniques for robust schedules. In Proceedings of 6th European conference on planning (ECP-01). – reference: ILOG (2003). OPL Studio 3.7. Language Manual. – reference: SchollABoysenNFliednerMThe sequence-dependent assembly line balancing problemOR Spectrum200830357960923995081193.9023510.1007/s00291-006-0070-3 – reference: Bockmayr, A., & Pisaruk, N. (2001). Solving an assembly line balancing problem by combining IP and CP. In Proceedings of the 6th annual workshop of ERCIM working droup on constraints. Prague, Czech Republic. – reference: Baptiste, P., & Le Pape, C. (1996). Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. In Proceedings of the fifteenth workshop of the UK planning special interest group. Liverpool. – reference: AndresCMirallesCPastorRBalancing and scheduling tasks in assembly lines with sequenc-dependent setup timesEuropean Journal of Operational Research2008187121212231137.9047610.1016/j.ejor.2006.07.044 – reference: KhayatGELangevinARiopelDIntegrated production and material handling scheduling using mathematical programming and constraint programmingEuropean Journal of Operations Research2006175181818321142.9037110.1016/j.ejor.2005.02.077 – reference: Focacci, F., Laborie, P., Nuijten, W. (2000). Solving scheduling problems with setup times and alternative resources. AIPS 2000 Proceedings (pp. 92–101). – reference: MartinoLPastorRHeuristic procedures for solving the general assembly line balancing problem with setupsInternational Journal of Production Research20104861787180410.1080/00207540802577979 – reference: PinedoMLScheduling theory, algorithms, and systems20083New YorkSpringer1155.90008 – reference: SawikTMonolithic vs. hierarchical balancing and scheduling of a flexible assembly lineEuropean Journal of Operational Research200214311512419226241073.9051410.1016/S0377-2217(01)00328-9 – reference: MerengoCNavaFPozzettiABalancing and sequencing manual mixed-model assembly linesInternational Journal of Production Research19993712283528600949.9057010.1080/002075499190545 – reference: Laborie, P., & Rogerie, J. (2008). Reasoning with conditional time-intervals. In Proc. 21th international FLAIRS conference (FLAIRS 2008) (pp. 555–560). – reference: BoysenNFliednerMSchollAAssembly line balancing: Which model to use whenInternational Journal of Production Economics200811150952810.1016/j.ijpe.2007.02.026 – reference: HentenryckPConstraint and integer programming in OPLINFORMS Journal on Computing200214434537219462951238.9010210.1287/ijoc.14.4.345.2826 – reference: SmithBRossiFvan BeekPWalshTModellingHandbook of constraint programming2006AmsterdamElsevier Science37740610.1016/S1574-6526(06)80015-5 – reference: PastorRFerrerLGarciaAEvaluating optimization models to solve SALBPLecture Notes in Computer Science20072007470579180310.1007/978-3-540-74472-6_65 – reference: KimYKKimJYKimYAn endosymbiotic evolutionary algorithm for the integration of balancing and sequencing in mixed-model U-linesEuropean Journal of Operational Research200616883885221696141083.9001610.1016/j.ejor.2004.07.032 – reference: BoysenNFliednerMSchollASequencing mixed-model assembly lines: Survey, classification and model crituqeEuropean Journal of Operational Research200919234977324547681157.9040510.1016/j.ejor.2007.09.013 – reference: BaptistePLe PapeCNuijtenWConstraint-Based Scheduling2001BostonKluwer Academic Publishers1094.9000210.1007/978-1-4615-1479-4 – reference: Özdemir, R.G., Ayaǧ, Z., Çakır, D. (2004). Hazırlık sürelerinin azaltılması için bir hat dengeleme modeli (YA/EM 2004). Kocaeli. – reference: FourerRGayDMExtending an algebraic modeling language to support constraint programmingINFORMS Journal on Computing200214432234419462941238.9011310.1287/ijoc.14.4.322.2825 – reference: KimYKKimJYKimYA coevolutionary algorithm for balancing and sequencing in mixed model assembly linesApplied Intelligence20001324725810.1023/A:1026568011013 – reference: Regin, J.C. (1994). A filtering algorithm for constraints of difference in CSPs (AAAI-94) (pp. 362–367). Washington. – ident: 9142_CR9 – volume: 40 start-page: 669 issue: 7 year: 2008 ident: 9142_CR29 publication-title: Engineering Optimization doi: 10.1080/03052150801982509 – ident: 9142_CR20 – volume: 175 start-page: 1818 year: 2006 ident: 9142_CR31 publication-title: European Journal of Operations Research doi: 10.1016/j.ejor.2005.02.077 – volume-title: Constraint-Based Scheduling year: 2001 ident: 9142_CR7 doi: 10.1007/978-1-4615-1479-4 – volume: 187 start-page: 1212 year: 2008 ident: 9142_CR5 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.07.044 – start-page: 377 volume-title: Handbook of constraint programming year: 2006 ident: 9142_CR58 doi: 10.1016/S1574-6526(06)80015-5 – ident: 9142_CR14 – ident: 9142_CR37 – volume: 8 start-page: 7 year: 2002 ident: 9142_CR17 publication-title: Journal of Heuristics doi: 10.1023/A:1013653332557 – volume: 149 start-page: 417 year: 2003 ident: 9142_CR30 publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00764-6 – volume: 45 start-page: 3579 issue: 16 year: 2007 ident: 9142_CR61 publication-title: International Journal of Production Research doi: 10.1080/00207540701223410 – volume: 11 start-page: 754 year: 2000 ident: 9142_CR33 publication-title: Production Planning & Control doi: 10.1080/095372800750038355 – ident: 9142_CR18 – volume: 119 start-page: 557 year: 1999 ident: 9142_CR13 publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00364-6 – volume: 14 start-page: 387 issue: 4 year: 2002 ident: 9142_CR42 publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.14.4.387.2830 – volume: 2007 start-page: 791 issue: 4705 year: 2007 ident: 9142_CR47 publication-title: Lecture Notes in Computer Science doi: 10.1007/978-3-540-74472-6_65 – volume: 14 start-page: 119 year: 2002 ident: 9142_CR43 publication-title: International Journal of Flexible Manufacturing Systems doi: 10.1023/A:1014434117888 – ident: 9142_CR25 – volume: 4 start-page: 175 year: 2006 ident: 9142_CR41 publication-title: OR – volume: 154 start-page: 1 year: 2004 ident: 9142_CR54 publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00795-6 – volume: 2003 start-page: 1329 issue: 2774 year: 2003 ident: 9142_CR59 publication-title: Lecture notes in computer science doi: 10.1007/978-3-540-45226-3_180 – ident: 9142_CR46 – volume: 16 start-page: 5 issue: 1 year: 2001 ident: 9142_CR50 publication-title: Knowledge Engineering Review doi: 10.1017/S0269888901000042 – volume: 14 start-page: 263 year: 1980 ident: 9142_CR21 publication-title: Artificial Intelligence doi: 10.1016/0004-3702(80)90051-X – ident: 9142_CR15 – ident: 9142_CR36 – volume: 37 start-page: 2835 issue: 12 year: 1999 ident: 9142_CR40 publication-title: International Journal of Production Research doi: 10.1080/002075499190545 – volume: 30 start-page: 579 issue: 3 year: 2008 ident: 9142_CR56 publication-title: OR Spectrum doi: 10.1007/s00291-006-0070-3 – ident: 9142_CR4 – volume: 168 start-page: 838 year: 2006 ident: 9142_CR34 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.032 – volume: 34 start-page: 271 issue: 4 year: 2002 ident: 9142_CR44 publication-title: Annals of Mathematics and Artificial Intelligence doi: 10.1023/A:1014440424150 – volume-title: Constraint satisfaction in logic programming year: 1989 ident: 9142_CR24 – volume: 11 start-page: 177 year: 1999 ident: 9142_CR60 publication-title: International Journal of Flexible Manufacturing Systems doi: 10.1023/A:1008067422364 – ident: 9142_CR51 – volume: 13 start-page: 247 year: 2000 ident: 9142_CR32 publication-title: Applied Intelligence doi: 10.1023/A:1026568011013 – volume: 69 start-page: 1 year: 1997 ident: 9142_CR2 publication-title: Annals of Operation Research doi: 10.1023/A:1018916608787 – volume-title: Scheduling theory, algorithms, and systems year: 2008 ident: 9142_CR48 – volume: 38 start-page: 3267 year: 2000 ident: 9142_CR52 publication-title: International Journal of Production Research doi: 10.1080/002075400418252 – volume: 20 start-page: 455 issue: 5 year: 2009 ident: 9142_CR12 publication-title: Production Planning & Control doi: 10.1080/09537280903011626 – volume: 47 start-page: 480 issue: 3 year: 2001 ident: 9142_CR16 publication-title: Management Science doi: 10.1287/mnsc.47.3.480.9777 – ident: 9142_CR49 – volume: 48 start-page: 1787 issue: 6 year: 2010 ident: 9142_CR39 publication-title: International Journal of Production Research doi: 10.1080/00207540802577979 – volume: 192 start-page: 349 year: 2009 ident: 9142_CR11 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2007.09.013 – volume: 13 start-page: 258 issue: 4 year: 2001 ident: 9142_CR28 publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.13.4.258.9733 – volume-title: Balancing and sequencing assembly lines year: 1999 ident: 9142_CR55 doi: 10.1007/978-3-662-11223-6 – ident: 9142_CR8 doi: 10.1016/S1474-6670(17)37738-8 – start-page: 169 volume-title: Handbook of constraint programming year: 2006 ident: 9142_CR26 doi: 10.1016/S1574-6526(06)80010-6 – ident: 9142_CR27 – volume: 23 start-page: 229 year: 2010 ident: 9142_CR62 publication-title: Engineering Applications of Artificial Intelligence doi: 10.1016/j.engappai.2009.07.002 – volume: 48 start-page: 5157 issue: 17 year: 2009 ident: 9142_CR3 publication-title: International Journal of Production Research doi: 10.1080/00207540903117857 – ident: 9142_CR6 – volume: 111 start-page: 509 year: 2008 ident: 9142_CR10 publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2007.02.026 – volume: 14 start-page: 322 issue: 4 year: 2002 ident: 9142_CR19 publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.14.4.322.2825 – ident: 9142_CR1 doi: 10.1016/0895-7177(93)90068-A – ident: 9142_CR38 – volume: 1 start-page: 285 issue: 2 year: 2000 ident: 9142_CR23 publication-title: ACM Transactions on Computational Logic doi: 10.1145/359496.359529 – volume: 13 start-page: 301 year: 2010 ident: 9142_CR35 publication-title: Journal of Scheduling doi: 10.1007/s10951-009-0144-6 – volume: 14 start-page: 345 issue: 4 year: 2002 ident: 9142_CR22 publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.14.4.345.2826 – ident: 9142_CR57 doi: 10.1007/s00291-011-0265-0 – volume: 48 start-page: 5363 issue: 18 year: 2009 ident: 9142_CR45 publication-title: International Journal of Production Research doi: 10.1080/00207540903140750 – volume: 143 start-page: 115 year: 2002 ident: 9142_CR53 publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(01)00328-9
SSID	ssj0009734
Score	2.133465
Snippet	Mixed model assembly line literature involves two problems: balancing and model sequencing. The general tendency in current studies is to deal with these...
SourceID	pascalfrancis crossref springer
SourceType	Index Database Enrichment Source Publisher
StartPage	434
SubjectTerms	Application Applied sciences Artificial Intelligence Computer Science Exact sciences and technology Firm modelling Inventory control, production control. Distribution Mathematical programming Operational research and scientific management Operational research. Management science Operations Research/Decision Theory Optimization Scheduling, sequencing
Title	Balancing and scheduling of flexible mixed model assembly lines
URI	https://link.springer.com/article/10.1007/s10601-013-9142-6
Volume	18
WOSCitedRecordID	wos000317978200005&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: PRVAVX databaseName: SpringerLink customDbUrl: eissn: 1572-9354 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009734 issn: 1383-7133 databaseCode: RSV dateStart: 19970301 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/eLvHCXMwnV1ZSwMxEA5afRDEemI9Sh58Uha2m2yOJ1Gx-CBFPErflmwOKPSiW0X_vZM9rMUD9D0Zlpl8OzPM8SF00lLCwVMJAy6FCig4gSBVgEeZ2pBbI1smp3vr3vJOR_R68q6c486qbveqJJn_qT8Nu7E89fXVYhDJltEKeDvh0Xj_0J1v2uVFKRlSr8BnYFUp8zsRC85ofaIy0IsrCC2-VEZzh9Ou_-tTN9FGGV_ii-JBbKElO9pG9Yq7AZdQ3kHnl76nUYNUrEYGQ44LPsePpuOxw85vyUwHFg_7r9bgnC0HQ5Rth-ngDfvANNtFT-3rx6uboCRTCDTYYhbEhKaMm9Dzg1lCnKKUKu6UkKnUUagc1TpOKddRGjOhbQR4VC1tCTMOMMzIHqqNxiO7j7CmhMU6FNxJQhkLFWSRIo6kMyGlkSENFFZaTXS5adwTXgyS-Y5kr6AEFJR4BSWsgU4_rkyKNRu_HW4umOrjRgTJj69sNtBZZZekhGT2s7iDP50-RGtRzojhO3aPUG02fbbHaFW_zPrZtJk_xXeqQtYI
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1ZS8NAEB60CgriLdaj7oNPSiBNNpvkSVQsFWsRraVvYbMHFHrRVNF_72yO1uIB-r47hJmdzHzM8QGcVnmg8anYlh8G3KIYBKyYoz-GsbJ9JcOqTOne2g2_2Qw6nfAhn-NOim73oiSZ_qk_DbuxFPqaajGKZIuwRDFgmT6-x6f2bNOun5WSEXpZBoEVpczvRMwFo7URT1AvOiO0-FIZTQNObeNfn7oJ63l-SS6zB7EFC2qwDRsFdwPJXXkHLq5MT6NAqYQPJEGMizHHjKaToSbabMmMe4r0u29KkpQth2CWrfpx752YxDTZhefaTeu6buVkCpZAW0wsz6Ux86Vt-MGU62pOKeW-5kEYh8KxuaZCeDH1hRN7LBDKQX_kVaFcJjX6MHP3oDQYDtQ-EEFd5gk78HXoUsZsjigy8JxQS5tSR7plsAutRiLfNG4IL3rRbEeyUVCECoqMgiJWhrPplVG2ZuO3w5U5U01vOAh-TGWzDOeFXaLcJZOfxR386fQJrNRb942ocdu8O4RVJ2XHMN27R1CajF_UMSyL10k3GVfSZ_kBu8PY7A
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1ZS8NAEB60ighiPbEedR98UoLbZLNJnsSrKJZSUEvfwmYPKLRpaaLov3c3R2vxAPF9dxLmYOZjZucDOGkwX2lXwZYX-MwiOglYEdPxGEQSe1IEDZHRvXVbXrvt93pBp-A5Tcpp97Ilmb9pMFua4vR8LNT5p4dvNIPBpnOsxdNFWCKGM8jA9cfubOuul7eVNQyzDBor25rfiZhLTGtjlmgdqZzc4kuXNEs-zeq_f3sD1ou6E13mjrIJCzLegmrJ6YCKEN-Giysz68j1FxCLBdLYV-ci82QdjRRSZntmNJBo2H-TAmUsOkhX33IYDd6RKViTHXhu3j5d31kFyYLFtY1Sy3VIRD2BDW-YdBzFCCHMU8wPooDbmCnCuRsRj9uRS30ubR2nrMGlQ4XSsU2dXajEo1juAeLEoS7HvqcCh1CKmUaXvmsHSmBCbOHUAJcaDnmxgdwQYQzC2e5ko6BQKyg0CgppDU6nV8b5-o3fDtfnzDa9YWtQZDqeNTgrbRQWoZr8LG7_T6ePYaVz0wxb9-2HA1i1M9IMM9R7CJV08iKPYJm_pv1kUs889AOJ-eHQ
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=Balancing+and+scheduling+of+flexible+mixed+model+assembly+lines&rft.jtitle=Constraints+%3A+an+international+journal&rft.au=%C3%96zt%C3%BCrk%2C+Cemalettin&rft.au=Tunal%C4%B1%2C+Semra&rft.au=Hnich%2C+Brahim&rft.au=%C3%96rnek%2C+M.+Arslan&rft.date=2013-07-01&rft.issn=1383-7133&rft.eissn=1572-9354&rft.volume=18&rft.issue=3&rft.spage=434&rft.epage=469&rft_id=info:doi/10.1007%2Fs10601-013-9142-6&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10601_013_9142_6
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1383-7133&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1383-7133&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1383-7133&client=summon