{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T08:26:42Z","timestamp":1749025602331},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,7,25]],"date-time":"2006-07-25T00:00:00Z","timestamp":1153785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2006,11,29]]},"DOI":"10.1007\/s10288-006-0017-1","type":"journal-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T07:58:37Z","timestamp":1153727917000},"page":"297-317","source":"Crossref","is-referenced-by-count":8,"title":["Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem"],"prefix":"10.1007","volume":"4","author":[{"given":"Fabrice","family":"Tercinet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"N\u00e9ron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Lent\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,7,25]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1018995000688","volume":"92","author":"P Baptiste","year":"1999","unstructured":"Baptiste P, Le Pape C, Nuijten W (1999) Satisfiability tests and time bound adjustments for cumulative scheduling problems. Ann Oper Res 92:305\u2013333","journal-title":"Ann Oper Res"},{"key":"17_CR2","unstructured":"Bourjolly JM, Rebetz V (2004) An analysis of lower bounds procedures for the bin packing problem. Eur J Oper Res (to appear)"},{"key":"17_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03088-2","volume-title":"Scheduling algorithms","author":"P Brucker","year":"1995","unstructured":"Brucker P (1995) Scheduling algorithms. Springer, Berlin Heidelberg New York"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0377-2217(87)90243-8","volume":"29","author":"J Carlier","year":"1987","unstructured":"Carlier J (1987) Scheduling jobs with release dates and tails on identical machines to minimize makespan. Eur J Oper Res 29:298\u2013306","journal-title":"Eur J Oper Res"},{"issue":"3","key":"17_CR5","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1051\/ro\/1991250303111","volume":"25","author":"J Carlier","year":"1991","unstructured":"Carlier J, Latapie B (1991) Une M\u00e9thode Arborescente pour R\u00e9soudre les Probl\u00e8mes Cumulatifs. RAIRO-RO 25(3):311\u2013340","journal-title":"RAIRO-RO"},{"key":"17_CR6","unstructured":"Carlier J, N\u00e9ron E (2004) Computing redundant resources for the resource constrained project scheduling problem. Eur J Oper Res (to appear)"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/A:1018968332237","volume":"83","author":"J Carlier","year":"1998","unstructured":"Carlier J, Pinson E (1998) Jackson\u2019s pseudo preemptive schedule for the Pm\/r i ,q i \/C max scheduling problem. Ann Oper Res 83:41\u201358","journal-title":"Ann Oper Res"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Carlier J, Pinson E (2004) Jackson pseudo preemptive schedule and cumulative scheduling problems. Ann Oper Res (to appear)","DOI":"10.1016\/j.dam.2003.09.009"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(95)00041-0","volume":"18","author":"HY Chao","year":"1995","unstructured":"Chao HY, Harper MP, Quong RW (1995) A tight lower bound for optimal bin packing. Oper Res Lett 18:133\u2013138","journal-title":"Oper Res Lett"},{"issue":"2","key":"17_CR10","first-page":"181","volume":"7","author":"M Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico M, Martello S (1995) Optimal scheduling of tasks on identical parallel processors. J Comput 7(2):181\u2013200","journal-title":"J Comput"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Elhedhli S (2004) Ranking lower bounds for the bin packing problem. Eur J Operl Res (to appear)","DOI":"10.1016\/j.ejor.2003.06.019"},{"key":"17_CR12","first-page":"7","volume":"5","author":"J Erschler","year":"1991","unstructured":"Erschler J, Lopez P, Thuriot C (1991) Raisonnement Temporel sous Contraintes de Ressources et Probl\u00e8mes d\u2019Ordonnancement. Rev Intell Artif 5:7\u201332","journal-title":"Rev Intell Artif"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s101070100243","volume":"91","author":"S Fekete","year":"1991","unstructured":"Fekete S, Schepers J (1991) New classes of fast lower bounds for bin packing problems. Math Progr 91:11\u201331","journal-title":"Math Progr"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Fekete SP, Schepers J (1998) New classes of lower bounds for bin packing problems. (Lecture Notes in Computer Science, vol 1412, pp 257\u2013270). Springer, Berlin Heidelberg New York","DOI":"10.1007\/3-540-69346-7_20"},{"key":"17_CR15","unstructured":"Gharbi A, Haouari M (1999) A new exact algorithm for the P|r i ,q j |C max scheduling problem. M\u00e9moire de DEA, Universit\u00e9 de Tunis III"},{"key":"17_CR16","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1002\/jos.103","volume":"5","author":"M Haouari","year":"2002","unstructured":"Haouari M, Gharbi A (2002) A new exact algorithm for the P|r i ,q j |C max scheduling problem. J Scheduling 5:329\u2013335","journal-title":"J Scheduling"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Haouari M, Gharbi A (2004) Fast lifting procedures for the bin packing problem (submitted)","DOI":"10.1016\/j.disopt.2005.06.002"},{"key":"17_CR18","unstructured":"Hoogeven H, Hurkens C, Lenstra JK, Vandevelde A (1995) Lower bounds for the multiprocessor flow shop. In: 2nd workshop on models and algorithms for planning and scheduling, Wernigerode"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Horn WA (1974) Some simple scheduling algorithms. Naval Res Logist Q 177\u2013185","DOI":"10.1002\/nav.3800210113"},{"key":"17_CR20","unstructured":"Jackson J-R (1955) Scheduling a production line to minimize maximum tardiness. Research Report 43, University of California, Los Angeles. Management Science Research Project"},{"key":"17_CR21","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson DS, Demers A, Ullman JD, Garey MR, Graham RL (1974) Worst case performance bounds for simple one-dimensional packing algorithms. SIAM J Comput 3:299\u2013325","journal-title":"SIAM J Comput"},{"key":"17_CR22","first-page":"241","volume":"16","author":"A Lahrichi","year":"1982","unstructured":"Lahrichi A (1982) Ordonnancements: La Notion de \u201cParties Obligatoires\u201d et son Application aux Probl\u00e8mes Cumulatifs. R.A.I.R.O.-R.O 16:241\u2013262","journal-title":"R.A.I.R.O.-R.O"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys M (1993) Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG, Zipkin PH (eds) Logistics of production and inventory. Handbook in operations research and management science 4","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"17_CR24","first-page":"453","volume":"26","author":"P Lopez","year":"1992","unstructured":"Lopez P, Erschler J, Esquirol P (1992) Ordonnancement de T\u00e2ches sous Contraintes: une Approche \u00e9nerg\u00e9tique. R.A.I.R.O.-A.P.I.I. 26:453\u2013481","journal-title":"R.A.I.R.O.-A.P.I.I."},{"key":"17_CR25","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Lower bounds and reduction procedure for the bin packing problem. Discret Appl Math 28:59\u201370","journal-title":"Discret Appl Math"},{"key":"17_CR26","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/S0305-0483(01)00040-8","volume":"29","author":"E N\u00e9ron","year":"2001","unstructured":"N\u00e9ron E, Baptiste Ph, Gupta JND (2001) Solving hybrid flow-shop using energetic reasoning. Omega 29:501\u2013511","journal-title":"Omega"},{"key":"17_CR27","unstructured":"Tercinet F (2004) M\u00e9thodes arborescentes pour la r\u00e9solution des probl\u00e8mes d\u2019ordonnancement, conception d\u2019un outil d\u2019aide au d\u00e9veloppement. PhD Thesis, Universit\u00e9 Fran\u00e7ois Rabelais Tours"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0017-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-006-0017-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0017-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:54Z","timestamp":1559131974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-006-0017-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,25]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,11,29]]}},"alternative-id":["17"],"URL":"https:\/\/doi.org\/10.1007\/s10288-006-0017-1","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,25]]}}}