{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:08:02Z","timestamp":1759666082818,"version":"3.44.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,3,27]],"date-time":"2004-03-27T00:00:00Z","timestamp":1080345600000},"content-version":"vor","delay-in-days":4072,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0166-218x(93)90176-o","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"17-29","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["Solving makespan minimization problems with Lagrangean decomposition"],"prefix":"10.1016","volume":"42","author":[{"given":"Monique","family":"Guignard","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90176-O_BIB1","series-title":"RC 14279","article-title":"Scheduling on parallel unrelated machines with set-ups","author":"Dietrich","year":"1988"},{"key":"10.1016\/0166-218X(93)90176-O_BIB2","article-title":"A two-phase heuristic for scheduling on parallel unrelated machines with set-ups","author":"Dietrich","year":"1989","journal-title":"FMS Conference"},{"key":"10.1016\/0166-218X(93)90176-O_BIB3","article-title":"On solving a 0\u20131 model for workload allocation on parallel unrelated machines with set-ups","author":"Dietrich","year":"1989","journal-title":"Third ORSA\/TIMS Special Interest Conference on FMS"},{"key":"10.1016\/0166-218X(93)90176-O_BIB4","series-title":"Modern Production Management Systems","first-page":"231","article-title":"A mathematical formulation of a hierarchical approach for production planning in FMS","author":"Escudero","year":"1987"},{"key":"10.1016\/0166-218X(93)90176-O_BIB5","article-title":"General aggregation schemes in Lagrangean decomposition","author":"Guignard","year":"1989","journal-title":"Department of Decision Sciences Report 89-12-7"},{"key":"10.1016\/0166-218X(93)90176-O_BIB6","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1051\/ro\/1987210403071","article-title":"Lagrangean decomposition for integer programming: theory and applications","volume":"21","author":"Guignard","year":"1987","journal-title":"RAIRO Rech. Op\u00e9r."},{"journal-title":"Oral communications","year":"1989","author":"Lee","key":"10.1016\/0166-218X(93)90176-O_BIB7"},{"key":"10.1016\/0166-218X(93)90176-O_BIB8","series-title":"Report ES-141\/88","article-title":"Um novo esquema de decomposi\u00e7\u00e2o lagrangeana em programa\u00e7\u00e2o linear inteira","author":"Reinoso","year":"1988"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390176O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390176O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:52:47Z","timestamp":1757451167000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390176O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["0166218X9390176O"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90176-o","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1993,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Solving makespan minimization problems with Lagrangean decomposition","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0166-218X(93)90176-O","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1993 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}