{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:54:42Z","timestamp":1729655682009,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icsmc.2004.1399840","type":"proceedings-article","created":{"date-parts":[[2005,3,31]],"date-time":"2005-03-31T13:26:51Z","timestamp":1112275611000},"page":"1481-1485","source":"Crossref","is-referenced-by-count":2,"title":["Minimizing total tardiness on a single machine with sequence-dependent setup times"],"prefix":"10.1109","volume":"2","author":[{"given":"A.","family":"Souissi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Kacem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","article-title":"New lower bound for minimizing total tardiness on a single machine with sequence-dependant setups","author":"souissi","year":"2004","journal-title":"PMS 2004"},{"key":"13","article-title":"A hybrid heuristic for the just in time single machine scheduling problem with setups: A comparison with a simulated annealing approach","author":"rabadi","year":"0","journal-title":"Annals of Operations Research"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)E0160-Y"},{"key":"11","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0305-0483(99)00050-X","article-title":"A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times","volume":"28","author":"tan","year":"2000","journal-title":"Omega"},{"key":"12","first-page":"274","article-title":"Application of constraint programming to a scheduling problem with a common due date and setup times","author":"rabadi","year":"2001","journal-title":"First International Industrial Engineering Conference Amman-Jordan"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(95)00023-D"},{"key":"2","first-page":"119","author":"jouglet","year":"2002","journal-title":"Ordonnancer une Machine pour Minimiser la Somme des Cou?ts"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.4.701"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0483(97)00024-8"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0483(98)00042-5"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.33.2.363"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00028-C"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(93)E0021-K"},{"key":"8","first-page":"1375","article-title":"A branch-and-bound method for minimum tardiness sequencing on a single processor with sequence dependent setup times","author":"ragatz","year":"1993","journal-title":"Proceedings Twenty-fourth annual meeting of the Decision Sciences Institute"}],"event":{"name":"2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)","acronym":"ICSMC-04","location":"The Hague, Netherlands"},"container-title":["2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9622\/30422\/01399840.pdf?arnumber=1399840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T13:50:55Z","timestamp":1497621055000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1399840\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/icsmc.2004.1399840","relation":{},"subject":[]}}