{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:39:25Z","timestamp":1725680365858},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298271"},{"type":"electronic","value":"9783642298288"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_5","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T07:59:40Z","timestamp":1336982380000},"page":"66-80","source":"Crossref","is-referenced-by-count":1,"title":["Complete Characterization of Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Jean-Charles","family":"Billaut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Hebrard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Lopez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1007\/978-3-540-74484-9_89","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2007","author":"M.A. Aloulou","year":"2007","unstructured":"Aloulou, M.A., Artigues, C.: Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007, Part III. LNCS, vol.\u00a04707, pp. 1027\u20131036. Springer, Heidelberg (2007)"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.ejor.2004.04.004","volume":"165","author":"C. Artigues","year":"2005","unstructured":"Artigues, C., Billaut, J.-C., Esswein, C.: Maximization of solution flexibility for robust shop scheduling. European Journal of Operational Research\u00a0165(2), 314\u2013328 (2005)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5_CR3","first-page":"112","volume":"6","author":"C. Artigues","year":"1999","unstructured":"Artigues, C., Roubellat, F., Billaut, J.-C.: Characterization of a set of schedules in a resource-constrained multi-project scheduling problem with multiple modes. International Journal of Industrial Engineering\u00a06(2), 112\u2013122 (1999)","journal-title":"International Journal of Industrial Engineering"},{"unstructured":"Bailleux, O., Marquis, P.: DISTANCE-SAT: Complexity and Algorithms. In: AAAI, pp. 642\u2013647 (1999)","key":"5_CR4"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1613\/jair.2169","volume":"29","author":"J.C. Beck","year":"2007","unstructured":"Beck, J.C.: Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling. JAIR\u00a029, 49\u201377 (2007)","journal-title":"JAIR"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF01190819","volume":"32","author":"M. Bennett","year":"1994","unstructured":"Bennett, M., Birkhoff, G.: Two families of Newman lattices. Algebra Universalis\u00a032(1), 115\u2013144 (1994)","journal-title":"Algebra Universalis"},{"unstructured":"Billaut, J.-C., Lopez, P.: Enumeration of all optimal sequences in the two-machine flowshop. In: Computational Engineering in Systems Applications (CESA 1998), Symposium on Industrial and Manufacturing Systems, IMACS \/ IEEE-SMC, Hammamet, Tunisie, pp. 378\u2013382 (April 1998)","key":"5_CR7"},{"doi-asserted-by":"crossref","unstructured":"Billaut, J.-C., Lopez, P.: Characterization of all rho-approximated sequences for some scheduling problems. In: Emerging Technologies and Factory Automation (ETFA 2011), Toulouse (September 2011)","key":"5_CR8","DOI":"10.1109\/ETFA.2011.6059026"},{"volume-title":"Scheduling with Flexibility and Robustness","year":"2008","unstructured":"Billaut, J.-C., Moukrim, A., Sanlaville, E. (eds.): Scheduling with Flexibility and Robustness. ISTE Ltd., Wiley, London (2008)","key":"5_CR9"},{"issue":"6","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1080\/00207549608904984","volume":"34","author":"J.-C. Billaut","year":"1996","unstructured":"Billaut, J.-C., Roubellat, F.: A new method for workshop real time scheduling. International Journal of Production Research\u00a034(6), 1555\u20131579 (1996)","journal-title":"International Journal of Production Research"},{"issue":"15","key":"5_CR11","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1016\/j.dam.2005.04.011","volume":"154","author":"J.-L. Bouquard","year":"2006","unstructured":"Bouquard, J.-L., Lent\u00e9, C., Billaut, J.-C.: Application of an optimization problem in max-plus algebra to scheduling problems. Discrete Applied Mathematics\u00a0154(15), 2041\u20132238 (2006)","journal-title":"Discrete Applied Mathematics"},{"unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting Systematic Search by Weighting Constraints. In: ECAI, pp. 482\u2013486 (2004)","key":"5_CR12"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1137\/0122054","volume":"22","author":"V. Bowman","year":"1972","unstructured":"Bowman, V.: Permutation polyhedra. SIAM Journal on Applied Mathematics\u00a022(4), 580\u2013589 (1972)","journal-title":"SIAM Journal on Applied Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Briand, C., Huguet, M.-J., La, H.T., Lopez, P.: Constraint-based approaches for robust scheduling. In: Scheduling with Flexibility and Robustness, pp. 199\u2013226. ISTE Ltd., Wiley (2008)","key":"5_CR14","DOI":"10.1002\/9780470611432.ch9"},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10951-007-0010-3","volume":"10","author":"C. Briand","year":"2007","unstructured":"Briand, C., La, H.T., Erschler, J.: A robust approach for the single machine scheduling problem. Journal of Scheduling\u00a010(3), 209\u2013221 (2007)","journal-title":"Journal of Scheduling"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF00383444","volume":"8","author":"G. Brightwell","year":"1991","unstructured":"Brightwell, G., Winkler, P.: Counting linear extensions. Order\u00a08, 225\u2013242 (1991)","journal-title":"Order"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/opre.31.1.114","volume":"31","author":"J. Erschler","year":"1983","unstructured":"Erschler, J., Fontan, G., Merc\u00e9, C., Roubellat, F.: A new dominance concept in scheduling n jobs on a single machine with ready times and due dates. Operations Research\u00a031, 114\u2013127 (1983)","journal-title":"Operations Research"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-13520-0_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"D. Grimes","year":"2010","unstructured":"Grimes, D., Hebrard, E.: Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 147\u2013161. Springer, Heidelberg (2010)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-04244-7_33","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"D. Grimes","year":"2009","unstructured":"Grimes, D., Hebrard, E., Malapert, A.: Closing the Open Shop: Contradicting Conventional Wisdom. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 400\u2013408. Springer, Heidelberg (2009)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S.M. Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-stage production with setup times included. Naval Research Quarterly\u00a01, 61\u201368 (1954)","journal-title":"Naval Research Quarterly"},{"unstructured":"Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Nogood Recording from Restarts. In: IJCAI, pp. 131\u2013136 (2007)","key":"5_CR21"},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0165-4896(94)00731-4","volume":"27","author":"G. Markowsky","year":"1994","unstructured":"Markowsky, G.: Permutation lattices revised. Mathematical Social Sciences\u00a027(1), 59\u201372 (1994)","journal-title":"Mathematical Social Sciences"},{"issue":"5","key":"5_CR23","first-page":"683","volume":"8","author":"F. Roubellat","year":"1995","unstructured":"Roubellat, F., Billaut, J.-C., Villaumi\u00e9, M.: Ordonnancement d\u2019ateliers: d\u2019Orabaid \u00e0 Ordo (in French). Revue d\u2019Automatique et de Productique Appliqu\u00e9es\u00a08(5), 683\u2013713 (1995)","journal-title":"Revue d\u2019Automatique et de Productique Appliqu\u00e9es"},{"issue":"3","key":"5_CR24","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/S0377-2217(99)00311-2","volume":"126","author":"I. Sabuncuo\u011flu","year":"2000","unstructured":"Sabuncuo\u011flu, I., Bayiz, M.: Analysis of reactive scheduling problems in a job shop environment. European Journal of Operational Research\u00a0126(3), 567\u2013586 (2000)","journal-title":"European Journal of Operational Research"},{"issue":"17","key":"5_CR25","doi-asserted-by":"publisher","first-page":"4211","DOI":"10.1080\/0020754031000149202","volume":"41","author":"I. Sabuncuo\u011flu","year":"2003","unstructured":"Sabuncuo\u011flu, I., Kizilisik, O.: Reactive scheduling in a dynamic and stochastic fms environment. International Journal of Production Research\u00a041(17), 4211\u20134231 (2003)","journal-title":"International Journal of Production Research"},{"unstructured":"Sevastyanov, S., Lin, B.M.T.: Efficient enumeration of optimal and approximate solutions of the two-machine flow-shop problem. In: 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2011), Nymburk, Czech Republic (June 2011)","key":"5_CR26"},{"issue":"4","key":"5_CR27","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/S0305-0548(02)00021-7","volume":"30","author":"V. T\u2019kindt","year":"2003","unstructured":"T\u2019kindt, V., Gupta, J.N.D., Billaut, J.-C.: Two-machine flowshop scheduling with a secondary criterion. Computers and Operations Research\u00a030(4), 505\u2013526 (2003)","journal-title":"Computers and Operations Research"},{"unstructured":"Walsh, T.: Search in a Small World. In: IJCAI, pp. 1172\u20131177 (1999)","key":"5_CR28"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:17:45Z","timestamp":1620127065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}