{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:30:03Z","timestamp":1759847403577},"reference-count":28,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"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 &amp; Operations Research"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0305-0548(00)00097-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:57:31Z","timestamp":1027594651000},"page":"971-994","source":"Crossref","is-referenced-by-count":29,"title":["Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications"],"prefix":"10.1016","volume":"29","author":[{"given":"Ali","family":"Allahverdi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fawaz S.","family":"Al-Anzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00097-6_BIB1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB2","first-page":"133","article-title":"On two-machine scheduling with release dates and due dates to minimize maximum lateness","volume":"17","author":"Grabowski","year":"1980","journal-title":"Opsearch"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB3","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1016\/0305-0548(96)00012-3","article-title":"Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness","volume":"23","author":"Allahverdi","year":"1996","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB4","first-page":"47","article-title":"Optimal policies for a deterministic two-machine semi-ordered flowshop with maximum lateness objective","volume":"6","author":"Allahverdi","year":"1994","journal-title":"Transactions on Operational Research"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB5","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/0305-0548(91)90060-5","article-title":"Job lateness in a two-machine flowshop with setup times separated","volume":"18","author":"Dileepan","year":"1991","journal-title":"Computers Operations Research"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB6","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1057\/palgrave.jors.2600583","article-title":"Job lateness in flowshops with setup and removal times separated","volume":"49","author":"Allahverdi","year":"1998","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","article-title":"A review of scheduling research involving setup considerations","volume":"27","author":"Allahverdi","year":"1999","journal-title":"OMEGA The International Journal of Management Sciences"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB8","series-title":"Principles of distributed database systems","author":"Ozsu","year":"1991"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB9","doi-asserted-by":"crossref","first-page":"1332","DOI":"10.1109\/49.536483","article-title":"Design and evaluation of data allocation algorithms for distributed multimedia database systems","volume":"14","author":"Kwok","year":"1996","journal-title":"IEEE Journal of Selected Areas in Comm."},{"key":"10.1016\/S0305-0548(00)00097-6_BIB10","series-title":"Operations scheduling with applications in manufacturing and services","author":"Pinedo","year":"1999"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/05695557908974469","article-title":"Optimal two-stage production scheduling with setup times separated","volume":"11","author":"Yoshida","year":"1979","journal-title":"AIIE Transactions"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0305-0548(99)00010-6","article-title":"Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times","volume":"27","author":"Allahverdi","year":"2000","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB13","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0377-2217(95)00351-7","article-title":"The two-machine total completion time flow shop problem","volume":"90","author":"Della Croce","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB14","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic for the m-machine, n-job flowshop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"OMEGA"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB15","series-title":"The art of computer programming: sorting and searching","author":"Knuth","year":"1973"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB16","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB17","unstructured":"Hall NG, Posner ME. Generating experimental data for scheduling problems. Operations Research (to appear)."},{"key":"10.1016\/S0305-0548(00)00097-6_BIB18","doi-asserted-by":"crossref","first-page":"B630","DOI":"10.1287\/mnsc.16.10.B630","article-title":"A heuristic for the n-job, m-machine sequencing problem","volume":"16","author":"Campbell","year":"1970","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB19","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/mnsc.23.11.1174","article-title":"An evaluation of flowshop sequencing heuristics","volume":"23","author":"Dannenbring","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB20","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1287\/opre.45.5.702","article-title":"Minimizing makespan in a class of reentrant shops","volume":"45","author":"Wang","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB21","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1057\/palgrave.jors.2600397","article-title":"Scheduling alternative operations in two-machine flow-shops","volume":"48","author":"Pan","year":"1997","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB22","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1057\/palgrave.jors.2600408","article-title":"Minimizing makespan in parallel flowshops","volume":"48","author":"Sundararaghavan","year":"1997","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB23","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6377(82)90035-9","article-title":"A decomposition algorithm for the single machine total tardiness problem","volume":"1","author":"Potts","year":"1982","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB24","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0305-0548(98)00048-3","article-title":"Improved heuristics for the n-job single machine weighted tardiness problem","volume":"26","author":"Volgenant","year":"1999","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB25","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199903\/04)2:2<55::AID-JOS14>3.0.CO;2-5","article-title":"Solution of the single machine total tardiness problem","volume":"2","author":"Szwarc","year":"1999","journal-title":"Journal of Scheduling"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB26","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0305-0548(93)90083-U","article-title":"A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops","volume":"20","author":"Kim","year":"1993","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB27","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/0377-2217(94)00029-C","article-title":"Minimizing total tardiness in permutation flowshops","volume":"85","author":"Kim","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00097-6_BIB28","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L","article-title":"A branch and bound algorithm to minimize total tardiness with different release dates","volume":"39","author":"Chu","year":"1992","journal-title":"Naval Research Logistics"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000976?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000976?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T15:22:04Z","timestamp":1556378524000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000976"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":28,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0305054800000976"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00097-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}