{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:48:12Z","timestamp":1742932092906,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":59,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781461490555"},{"type":"electronic","value":"9781461490562"}],"license":[{"start":{"date-parts":[[2013,12,3]],"date-time":"2013-12-03T00:00:00Z","timestamp":1386028800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,12,3]],"date-time":"2013-12-03T00:00:00Z","timestamp":1386028800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-1-4614-9056-2_12","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T16:56:54Z","timestamp":1386003414000},"page":"277-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hybrid Flow Shop Scheduling with Availability Constraints"],"prefix":"10.1007","author":[{"given":"Hamid","family":"Allaoui","sequence":"first","affiliation":[]},{"given":"Abdelhakim","family":"Artiba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,3]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1287\/opre.41.4.641","volume":"41","author":"L. Adler","year":"1993","unstructured":"Adler, L., Fraiman, N., Kobacker, E., Pinedo, M., Plotnicoff, J. C. & Wu, T. P. (1993). BPSS: A scheduling support system for the packaging industry. Journal Operations Research, 41, 641\u2013648.","journal-title":"Journal Operations Research"},{"issue":"-10","key":"12_CR2","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1016\/0305-0548(96)00012-3","volume":"23","author":"A. Allahverdi","year":"1996","unstructured":"Allahverdi, A. (1996). Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness. Computer Operations Research, (23-10) 909\u2013916.","journal-title":"Computer Operations Research"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Allahverdi, A., & Mittenthal, J. (1998). Dual criteria scheduling on a two-machine flowshop subject to random breakdowns. International Transaction Operational Research, (5\u20134) 317\u2013324.","DOI":"10.1016\/S0969-6016(97)00042-7"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.cie.2004.09.002","volume":"47,","author":"H. Allaoui","year":"2004","unstructured":"Allaoui, H., & Artiba, A. (2004). Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Computers Industrial Engineering, 47, 431\u2013450.","journal-title":"Computers Industrial Engineering"},{"issue":"5","key":"12_CR5","doi-asserted-by":"publisher","first-page":"1399","DOI":"10.1016\/j.cor.2004.09.034","volume":"33","author":"H. Allaoui","year":"2006","unstructured":"Allaoui, H., Artiba, A. (2006). Two stage hybrid flow shop scheduling with availability constraints. Computers Operations Research, 33(5), 1399\u20131419.","journal-title":"Computers Operations Research"},{"issue":"1\u20132","key":"12_CR6","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.ijpe.2004.12.003","volume":"99","author":"H. Allaoui","year":"2006","unstructured":"Allaoui, H., Artiba, A., Elmaghraby, S. E., & Riane, F. (2006). Scheduling two machine flow shop with an availability constraint on the first machine. Int J Product Econ, 99(1\u20132), 16\u201327.","journal-title":"Int J Product Econ"},{"key":"12_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5709-8","volume-title":"Introduction to Intelligent Simulation: The RAO Language","author":"A. Artiba","year":"1998","unstructured":"Artiba, A., Emelyanov, V., Iaasinovski, S. (1998). Introduction to Intelligent Simulation: The RAO Language. Kluwer Academic Publishers: Dordercht."},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1287\/opre.44.2.327","volume":"44","author":"A. N. Avramidis","year":"1996","unstructured":"Avramidis, A. N., & Wilson, J. R. (1996). Integrated variance reduction strategies for simulation. Operations Research, 44(2), 327\u2013346.","journal-title":"Operations Research"},{"key":"12_CR9","first-page":"491","volume":"31,","author":"M. Ben Daya","year":"1999","unstructured":"Ben Daya, M. (1999). Integrated Production, Maintenance, and Quality Model for Imperfect Processes. IIE Transactions, 31, 491\u2013501.","journal-title":"IIE Transactions"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1108\/02656719810220597","volume":"5,","author":"M. Ben Daya","year":"1998","unstructured":"Ben Daya, M., & Hariga, M. (1998). A Maintenance Inspection Model: Optimal and Heuristic Solutions. Inter J Quality Reliability Management, 5, 481\u2013488.","journal-title":"Inter J Quality Reliability Management"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1057\/palgrave.jors.2600586","volume":"49,","author":"M. Ben Daya","year":"1998","unstructured":"Ben Daya, M., Makhdoom, M. (1998). Integrated Production and Quality Model Under Various Preventive Maintenance Policies. Journal of the Operational Research Society, 49, 840\u2013853.","journal-title":"Journal of the Operational Research Society"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0377-2217(88)90192-0","volume":"37,","author":"J. Blazewicz","year":"1988","unstructured":"Blazewicz, J., Finke, G., Haupt, R., & Schmidt, G. (1988). New trends in scheduling theory. European Journal of Operational Research, 37, 303\u2013317.","journal-title":"European Journal of Operational Research"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/S0305-0483(01)00048-2","volume":"29,","author":"J. Blazewicz","year":"2001","unstructured":"Blazewicz, J., Breit, J., Formanowicz, P., Kubiak, W., & Schmidt, G. (2001) Heuristic algorithms for two-machine flowshop with limited machine availability. Omega, 29, 599\u2013608.","journal-title":"Omega"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0377-2217(91)90148-O","volume":"51","author":"S. A. Brah","year":"1991","unstructured":"Brah, S. A., Hunsucker, J. L. (1991). Branch and bound algorithm for the flow shop with multiple processors. European Journal of Operational Research,\n                51(1), 88\u201399.","journal-title":"European Journal of Operational Research"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"4381","DOI":"10.1080\/00207540210159527","volume":"40","author":"O. Braun","year":"2002","unstructured":"Braun, O., Lai, T. C., Schmidt, G., & Sotskov, Y. N. (2002). Stability of Johnson\u2019s schedule with respect to limited machine availability. International Journal of Production Research, 40, 4381\u20134400.","journal-title":"International Journal of Production Research"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Chen, B., Potts, C. N., & Woeginger, G. J. (1998). A review of machine scheduling: Complexity, algorithms and approximability. Handbook of Combinatorial Optimization (Volume 3). In D.-Z. Du, & P. Pardalos (Eds), Kluwer Academic Publishers. 21\u2013169.","DOI":"10.1007\/978-1-4613-0303-9_25"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0167-6377(00)00033-X","volume":"26","author":"T. C. E. Cheng","year":"2000","unstructured":"Cheng, T. C. E. & Wang, G. (2000). An improved heuristic for two-machine flowshop scheduling with an availability constraint. Operations Research Letters, 26, 223\u2013229.","journal-title":"Operations Research Letters"},{"key":"12_CR18","first-page":"985","volume":"33,","author":"S. E. Elmaghrabi","year":"2001","unstructured":"Elmaghrabi, S. E., & Soewandi, H. (2001). Sequencing jobs on two-stage hybrid flowshop with identical machines to minimize makespan. IIE Trans, 33, 985\u2013993.","journal-title":"IIE Trans"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1,","author":"M. R. Garey","year":"1976","unstructured":"Garey, M. R. Johnson, D. S., & Sethi, R. (1976). The complexity of flow shop and job shop scheduling. Math Oper Res, 1, 117\u2013129.","journal-title":"Math Oper Res"},{"key":"12_CR20","unstructured":"Garey, M. R., Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman."},{"key":"12_CR21","unstructured":"Grangeon, N. M\u00e9taheuristiques et mod\u00e8les d'\u00e9valuation pour le probl\u00e8me du flow shop hybride hi \u00e9rarchis\u00e9: Contexte d\u00e9terministe et contexte stochastique, Thesis at Universit\u00e9 Blaise Pascal."},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1018976827443","volume":"69,","author":"J. N. D. Gupta","year":"1994","unstructured":"Gupta, J. N. D., Hariri, A. M. A., & Potts, C. N. (1994). Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Annals of Operations Research, 69, 171\u2013191.","journal-title":"Annals of Operations Research"},{"key":"12_CR23","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","volume":"38,","author":"J. N. D. Gupta","year":"1988","unstructured":"Gupta, J. N. D. (1988). Two-stage, hybrid flowshop scheduling problem. The Journal of the Operational Research Society, 38, 359\u2013364.","journal-title":"The Journal of the Operational Research Society"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"1489","DOI":"10.1080\/00207549108948025","volume":"29,","author":"J. N. D. Gupta","year":"1991","unstructured":"Gupta, J. N. D., & Tunc, E. A. (1991). Schedules for a two stage hybrid flowshop with parallel machines at the second stage. International Journal of Production Research, 29, 1489\u20131502.","journal-title":"International Journal of Production Research"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Hall, L. A. (1995). Approximability of flow shop scheduling. Proc. 36th IEEE Symp. on Foundations of Computer Science, 82\u201391.","DOI":"10.1109\/SFCS.1995.492465"},{"key":"12_CR26","first-page":"196","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., & Karp, R. M. (1962). A dynamic programming Approach to Sequencing Problems. Journal of the SIAM, 10, 196\u2013210.","journal-title":"Journal of the SIAM"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D. S. Hochbaum","year":"1987","unstructured":"Hochbaum, D. S., Shmoys, D. B. (1987). Using dual approximation algorithms for scheduling problems: theoretical and practical results.Journal of the ACM, 34, 144\u2013162.","journal-title":"Journal of the ACM"},{"key":"12_CR28","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/0377-2217(94)00235-5","volume":"89,","author":"J. A. Hoogeveen","year":"1996","unstructured":"Hoogeveen, J. A., Lenstra, J. K. & Veltman, B. (1996). Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. European Journal of Operational Research,\n                89, 172\u2013175.","journal-title":"European Journal of Operational Research"},{"key":"12_CR29","first-page":"216","volume":"11,","author":"Z. H. Jin","year":"2002","unstructured":"Jin, Z. H., Ohno, K., Ito, T., Elmaghraby, & S. E. (2002). Scheduling hybrid flowshops in printed circuit board assembly lines. POM\n                11, 216\u2013230.","journal-title":"POM"},{"key":"12_CR30","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1,","author":"S. M. Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61\u201368.","journal-title":"Naval Research Logistics Quarterly"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Karp, R. M., (1972). Reducibility among combinatorial problems. In R. E. Miller,\n$\\backslash$\n\\& J. W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"12_CR32","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/S0377-2217(01)00083-2","volume":"136,","author":"W. Kubiak","year":"2002","unstructured":"Kubiak, W., Blazewicz, J., Formanowicz, P., Schmidt, G. (2002). Two-machine flowshop with limited machine availability. European Journal of Operational Research, 136, 528\u2013540.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"12_CR33","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1287\/opre.35.4.556","volume":"35","author":"M. A. Langston","year":"1987","unstructured":"Langston, M. A. (1987). Interstage transportation planning in the deterministic flow-shop environment. Operations Research,\n                35(4), 556\u2013564.","journal-title":"Operations Research"},{"key":"12_CR34","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0166-218X(91)90013-M","volume":"30","author":"C.-Y. Lee","year":"1991","unstructured":"Lee, C.-Y., (1991). Parallel machine scheduling with nonsimultaneous machine availabile time. Discrete Applied Mathematics, 30, 53\u201361.","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR35","first-page":"363","volume":"9","author":"C.-Y. Lee","year":"1996","unstructured":"Lee, C.-Y. (1996). Machine scheduling with an availability constraint. J.Global Optimization.9, 363\u2013382","journal-title":"J.Global Optimization."},{"issue":"5","key":"12_CR36","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1287\/mnsc.39.5.616","volume":"39","author":"C-Y Lee","year":"1993","unstructured":"Lee, C-Y, Cheng, T. C. E. & Lin, B. M. (1993). Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem. Management Science,\n                39(5), 616\u2013625.","journal-title":"Management Science"},{"key":"12_CR37","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0167-6377(94)90026-4","volume":"16","author":"C.-Y. Lee","year":"1994","unstructured":"Lee, C.-Y. & Vairaktarakis, G. L. (1994). Minimizing makespan in hybrid flowshops. Operations Research Letters\n                16, 149\u2013158.","journal-title":"Operations Research Letters"},{"key":"12_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1018909801944","volume":"70,","author":"C.-Y. Lee","year":"1997","unstructured":"Lee, C.-Y., Lei, L. & Pinedo, M. (1997). Current trends in deterministic scheduling. Annals of Operations Research, 70, 1\u201341.","journal-title":"Annals of Operations Research"},{"key":"12_CR39","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0167-6377(96)00041-7","volume":"20,","author":"Lee, C.-Y","year":"1997","unstructured":"Lee, C.-Y (1997) Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Operations Research Letters, 20, 129\u2013139.","journal-title":"Operations Research Letters"},{"key":"12_CR40","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1008009621190","volume":"10,","author":"C.-Y. Lee","year":"1998","unstructured":"Lee, C.-Y., & Vairaktarakis, G. (1998). Performance Comparison of Some Classes of Flexible Flowshops and Job Shops. International Journal of Flexible Manufacturing Systems, (Special Issue on Manufacturing Flexibility) 10, 379\u2013405.","journal-title":"International Journal of Flexible Manufacturing Systems"},{"issue":"2","key":"12_CR41","first-page":"198","volume":"114","author":"Lee, C.-Y","year":"1999","unstructured":"Lee, C.-Y. (1999). Two-Machine Flowshop Scheduling with Availability Constraints. European Journal of Operational Research, 114(2), 198\u2013207.","journal-title":"European Journal of Operational Research"},{"key":"12_CR42","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0360-8352(99)00023-6","volume":"37","author":"R Linn","year":"1999","unstructured":"Linn R, & Zhang W (1999) Hybrid flow shop scheduling: a survey\u201d. Computers & Industrial Engineering, 37, 57\u201361.","journal-title":"Computers & Industrial Engineering"},{"key":"12_CR43","first-page":"148","volume":"30,","author":"J Mittenthall","year":"1993","unstructured":"Mittenthall, J., & Ragavachari, M. (1993). Stochastic flowshops, Operations Research,\n                30, 148\u2013162.","journal-title":"Operations Research"},{"key":"12_CR44","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1080\/00207548408942479","volume":"22,","author":"S. L. Narasimhan","year":"1984","unstructured":"Narasimhan, S. L., Panwalkar, S. S. (1984). Scheduling in a two-stage manufacturing process. International Journal of Production Research, 22, 555\u2013564.","journal-title":"International Journal of Production Research"},{"key":"12_CR45","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1111\/j.1540-5915.1987.tb01520.x","volume":"18,","author":"S Narasimhan","year":"1987","unstructured":"Narasimhan, S., & Mangiameli, P. (1987). A comparison of sequencing rules for a two-stage hybrid flow shop. Decisions Science, 18, 250\u2013265.","journal-title":"Decisions Science"},{"key":"12_CR46","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1287\/opre.27.2.290","volume":"22,","author":"R. J. Paul","year":"1979","unstructured":"Paul, R. J. (1979). A production scheduling in the glass container industry. Operations Research, 22, 290\u2013302.","journal-title":"Operations Research"},{"key":"12_CR47","unstructured":"Pinedo, M. (2002). Scheduling: Theory, Algorithms and Systems (Second Edin), Prentice-Hall."},{"key":"12_CR48","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/S0377-2217(97)00333-0","volume":"107,","author":"MC Portman","year":"1998","unstructured":"Portman MC, Vignier A, Dardilhac D, & Dezalay D., (1998). Branch and bound crossed with GA to solve hybrid flowshops. European Journal of Operational Research,\n                107, 389\u2013400.","journal-title":"European Journal of Operational Research"},{"key":"12_CR49","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0925-5273(92)90006-S","volume":"27,","author":"C. Rajendran","year":"1992","unstructured":"Rajendran, C., & Chaudhuri, D. (1992). Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan. International Journal of Production Economics\n                27, 137\u2013143.","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"12_CR50","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0377-2217(98)00060-5","volume":"109","author":"F. Riane","year":"1998","unstructured":"Riane, F., Artiba, A., & Elmaghraby, S. E. (1998). A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan. European Journal of Operational Research\n                109,(2), 321\u2013329.","journal-title":"European Journal of Operational Research"},{"key":"12_CR51","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23,","author":"S Sahni","year":"1976","unstructured":"Sahni, S. (1976). Algorithms for scheduling independent tasks. Journal of the ACM, 23,116\u2013127.","journal-title":"Journal of the ACM"},{"key":"12_CR52","doi-asserted-by":"crossref","unstructured":"Salvador, M. S., (1973). A solution to a special case of flow shop scheduling problems. In Symposium of the Theory of Scheduling and Applications, Elmaghraby, ed, 83\u201391.","DOI":"10.1007\/978-3-642-80784-8_7"},{"key":"12_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121,","author":"G Schmidt","year":"2000","unstructured":"Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121, 1\u201315.","journal-title":"European Journal of Operational Research"},{"key":"12_CR54","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0304-3975(98)00157-1","volume":"237,","author":"P. Schuurman","year":"2000","unstructured":"Schuurman, P., & Woeginger, G. J. (2000). A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem, Theo Computer Science,\n                237, 105\u2013122.","journal-title":"Theo Computer Science"},{"key":"12_CR55","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0377-2217(89)90208-7","volume":"43,","author":"C. Sriskandarajah","year":"1989","unstructured":"Sriskandarajah, C., & Sethi, S. P. (1989). Scheduling algorithms for flexible flow shops: worst and average case performance. European Journal of Operational Research,\n                43, 143\u2013160.","journal-title":"European Journal of Operational Research"},{"key":"12_CR56","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1147\/rd.294.0401","volume":"29,","author":"R. J. Wittrock","year":"1985","unstructured":"Wittrock, R. J. (1985). Scheduling algorithms for flexible flow lines. IBM Journal Research Development, 29, 401\u2013412.","journal-title":"IBM Journal Research Development"},{"key":"12_CR57","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/opre.36.3.445","volume":"36,","author":"R. J. Wittrock","year":"1988","unstructured":"Wittrock, R. J. (1988). An adaptable scheduling algorithm for flexible flow lines. Journal Operations Research,\n                36, 445\u201353.","journal-title":"Journal Operations Research"},{"key":"12_CR58","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1287\/opre.45.2.288","volume":"45,","author":"D. P. Williamson","year":"1997","unstructured":"Williamson, D. P., Hall, L. A., Hoogeveen. J. A., Hurkens, C. A. J., Lenstra, J. K., Sevastianov, S. V., & Shmoys, D. B. (1997). Short shop schedules. Operations Research, 45, 288\u2013294","journal-title":"Operations Research"},{"key":"12_CR59","unstructured":"Zhou, J. R., Huang, J. R., & Jiang, W. S. (1996). Optimization production scheduling of multi-stage interrelated discrete system via synthetic knowledge. Proceedings of the American Control Conference, 724\u2013728."}],"container-title":["International Series in Operations Research & Management Science","Essays in Production, Project Planning and Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-9056-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T20:02:00Z","timestamp":1676836920000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4614-9056-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,3]]},"ISBN":["9781461490555","9781461490562"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-9056-2_12","relation":{},"ISSN":["0884-8289","2214-7934"],"issn-type":[{"type":"print","value":"0884-8289"},{"type":"electronic","value":"2214-7934"}],"subject":[],"published":{"date-parts":[[2013,12,3]]},"assertion":[{"value":"3 December 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}