{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:44:05Z","timestamp":1772757845321,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0360-8352(03)00075-5","type":"journal-article","created":{"date-parts":[[2003,10,9]],"date-time":"2003-10-09T03:38:24Z","timestamp":1065670704000},"page":"573-583","source":"Crossref","is-referenced-by-count":11,"title":["A hybrid approach to the single line scheduling problem with multiple products and sequence-dependent time"],"prefix":"10.1016","volume":"45","author":[{"given":"Roberto","family":"Spina","sequence":"first","affiliation":[]},{"given":"Luigi M","family":"Galantucci","sequence":"additional","affiliation":[]},{"given":"Michele","family":"Dassisti","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0360-8352(03)00075-5_BIB1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0360-8352(96)00206-9","article-title":"Costs in design of scheduling algorithm: A study on branch-and-bound methodology","volume":"32","author":"Amar","year":"1997","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0360-8352(03)00075-5_BIB2","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/S0377-2217(98)00364-6","article-title":"Constraint satisfaction problems: Algorithms and applications","volume":"119","author":"Brailsford","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0360-8352(03)00075-5_BIB3","series-title":"Advanced Models for Manufacturing System Management","author":"Brandimarte","year":"1995"},{"key":"10.1016\/S0360-8352(03)00075-5_BIB4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0360-8352(99)00022-4","article-title":"A tutorial survey of job-shop scheduling problems using genetic algorithms: parts II. hybrid genetic search","volume":"37","author":"Cheng","year":"1999","journal-title":"Computer and Industrial Engineering"},{"key":"10.1016\/S0360-8352(03)00075-5_BIB5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0004-3702(00)00040-0","article-title":"Constraint propagation techniques for the disjunctive scheduling problem","volume":"122","author":"Dorndorf","year":"2000","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0360-8352(03)00075-5_BIB6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0736-5845(00)00041-7","article-title":"Scheduling manufacturing systems in an agile environment","volume":"17","author":"He","year":"2001","journal-title":"Robotics and Computer Integrated Manufacturing"},{"key":"10.1016\/S0360-8352(03)00075-5_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(99)00435-X","article-title":"A framework for the description of evolutionary algorithms","volume":"126","author":"Hertz","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0360-8352(03)00075-5_BIB8","unstructured":"ILOG Scheduler 4.4\u2014User's Manual (1999). ILOG (F)."},{"key":"10.1016\/S0360-8352(03)00075-5_BIB9","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0360-8352(00)00044-9","article-title":"Multi-product planning and scheduling using genetic algorithm approach","volume":"38","author":"Ip","year":"2000","journal-title":"Computer and Industrial Engineering"},{"key":"10.1016\/S0360-8352(03)00075-5_BIB10","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","article-title":"Deterministic job-shop scheduling: Past, present and future","volume":"113","author":"Jain","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0360-8352(03)00075-5_BIB11","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0166-3615(99)00071-8","article-title":"Evaluation and comparison of production schedules","volume":"42","author":"Kempf","year":"2000","journal-title":"Computers in Industry"},{"key":"10.1016\/S0360-8352(03)00075-5_BIB12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0360-8352(99)00020-0","article-title":"A modified genetic algorithm for single machine scheduling","volume":"36","author":"Liu","year":"1999","journal-title":"Computer and Industrial Engineering"},{"key":"10.1016\/S0360-8352(03)00075-5_BIB13","series-title":"Genetic algorithm+data structures=evolution program","author":"Michalewicz","year":"1999"},{"key":"10.1016\/S0360-8352(03)00075-5_BIB14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/07408179908969810","article-title":"Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness","volume":"31","author":"Sun","year":"1999","journal-title":"IIE Transactions"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835203000755?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835203000755?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:24:32Z","timestamp":1550852672000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835203000755"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0360835203000755"],"URL":"https:\/\/doi.org\/10.1016\/s0360-8352(03)00075-5","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}