{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T06:11:29Z","timestamp":1781071889824,"version":"3.54.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2010,11,5]],"date-time":"2010-11-05T00:00:00Z","timestamp":1288915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10951-010-0203-z","type":"journal-article","created":{"date-parts":[[2010,11,4]],"date-time":"2010-11-04T19:09:03Z","timestamp":1288897743000},"page":"523-538","source":"Crossref","is-referenced-by-count":23,"title":["Scheduling jobs on parallel machines to minimize a regular step total cost function"],"prefix":"10.1007","volume":"14","author":[{"given":"Boris","family":"Detienne","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"St\u00e9phane","family":"Dauz\u00e8re-P\u00e9r\u00e8s","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claude","family":"Yugma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,11,5]]},"reference":[{"issue":"0","key":"203_CR1","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1018995000688","volume":"92","author":"Ph. Baptiste","year":"1999","unstructured":"Baptiste, Ph., Le Pape, C., & Nuijten, W. (1999). Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research, 92(0), 305\u2013333.","journal-title":"Annals of Operations Research"},{"key":"203_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(01)00353-8","volume":"144","author":"P. Baptiste","year":"2003","unstructured":"Baptiste, P., Peridy, L., & Pinson, E. (2003). A branch and bound to minimize the number of late jobs on a single machine with release time constraints. European Journal of Operational Research, 144, 1\u201311.","journal-title":"European Journal of Operational Research"},{"key":"203_CR3","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.ejor.2003.06.045","volume":"165","author":"C. T. Bornstein","year":"2005","unstructured":"Bornstein, C. T., Alcoforado, L. F., & Maculan, N. (2005). A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem. European Journal of Operational Research, 165, 649\u2013656.","journal-title":"European Journal of Operational Research"},{"key":"203_CR4","first-page":"25","volume-title":"IEEE\/SEMI advanced manufacturing conference","author":"A. Bousetta","year":"2005","unstructured":"Bousetta, A., & Cross, A. (2005). Adaptative sampling methodology for in-line defect inspection. In IEEE\/SEMI advanced manufacturing conference (pp.\u00a025\u201331)."},{"key":"203_CR5","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2007","unstructured":"Brucker, P. (2007). Scheduling algorithms. Berlin: Springer."},{"key":"203_CR6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J. Carlier","year":"1982","unstructured":"Carlier, J. (1982). The one-machine sequencing problem. European Journal of Operational Research, 11, 42\u201347.","journal-title":"European Journal of Operational Research"},{"key":"203_CR7","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0360-8352(01)00035-3","volume":"40","author":"P. C. Chang","year":"2001","unstructured":"Chang, P. C., & Su, L. H. (2001). Scheduling n jobs on one machine to minimize the maximum lateness with a minimum number of tardy jobs. Computers and Industrial Engineering, 40, 349\u2013360.","journal-title":"Computers and Industrial Engineering"},{"key":"203_CR8","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1109\/ICAL.2008.4636499","volume-title":"IEEE international conference on automation and logistics","author":"C.-L. Chen","year":"2008","unstructured":"Chen, C.-L. (2008). An iterated local search for unrelated parallel machines problem with unequal ready times. In IEEE international conference on automation and logistics, Qingdao, China (pp.\u00a02044\u20132047)."},{"key":"203_CR9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/nav.10056","volume":"50","author":"S. Dauz\u00e8re-P\u00e9r\u00e8s","year":"2002","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., & Sevaux, M. (2002). Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine. Naval Research Logistics, 50, 273\u2013288.","journal-title":"Naval Research Logistics"},{"key":"203_CR10","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1023\/B:JOSH.0000046073.05827.15","volume":"7","author":"S. Dauz\u00e8re-P\u00e9r\u00e8s","year":"2004","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., & Sevaux, M. (2004). An exact method to minimize the number of tardy jobs in single machine scheduling. Journal of Scheduling, 7, 405\u2013420.","journal-title":"Journal of Scheduling"},{"key":"203_CR11","volume-title":"Computers and intractability: a guide to the theory of NP completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP completeness. San Francisco: Freeman."},{"issue":"4","key":"203_CR12","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TSM.2007.907616","volume":"20","author":"R. Good","year":"2007","unstructured":"Good, R., & Purdy, M. (2007). An MILP approach to wafer sampling and selection. IEEE Transactions on Semiconductor Manufacturing, 20(4), 400\u2013407.","journal-title":"IEEE Transactions on Semiconductor Manufacturing"},{"key":"203_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"4","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy\u00a0Kan,\u00a0A.\u00a0H.\u00a0G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 4, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"203_CR14","unstructured":"Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness (Research Report 43). Management Science Research Project. University of California, Los Angeles."},{"key":"203_CR15","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/j.ejor.2006.11.036","volume":"184","author":"A. Jouglet","year":"2008","unstructured":"Jouglet, A., Savourey, D., Carlier, J., & Baptiste, P. (2008). Dominance-based heuristics for one-machine total cost scheduling problems. European Journal of Operational Research, 184, 879\u2013899.","journal-title":"European Journal of Operational Research"},{"key":"203_CR16","first-page":"312","volume-title":"Proceedings of the international symposium on semiconductor manufacturing conference","author":"S. B. Lee","year":"2003","unstructured":"Lee, S. B., Lee, T.-Y., Liao, J., & Chang, Y.-C. (2003). A capacity-dependence dynamic sampling strategy. In Proceedings of the international symposium on semiconductor manufacturing conference (pp. 312\u2013314). Berlin: Springer."},{"key":"203_CR17","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","year":"2004","unstructured":"Leung, J. Y.-T. (Ed.) (2004). Handbook of scheduling: algorithms, models, and performance analysis. London\/Boca Raton: Chapman & Hall\/CRC."},{"key":"203_CR18","first-page":"453","volume":"26","author":"P. Lopez","year":"1992","unstructured":"Lopez, P., Erschler, J., & Esquirol, P. (1992). Ordonnancement de\u00a0t\u00e2ches sous contraintes: une approche \u00e9nerg\u00e9tique. Automatique, Productique, Informatique Industrielle, 26, 453\u2013481.","journal-title":"Automatique, Productique, Informatique Industrielle"},{"key":"203_CR19","first-page":"153","volume":"31","author":"A. Meral","year":"1999","unstructured":"Meral, A., & Omer, K. (1999). Scheduling jobs on unrelated parallel machines to minimize regular total cost functions. IIE Transactions, 31, 153\u2013159.","journal-title":"IIE Transactions"},{"key":"203_CR20","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.ejor.2003.06.027","volume":"160","author":"R. M\u2019Hallah","year":"2005","unstructured":"M\u2019Hallah, R., & Bulfin, R. L. (2005). Minimizing the weighted number of tardy jobs on parallel processors. European Journal of Operational Research, 160, 471\u2013484.","journal-title":"European Journal of Operational Research"},{"key":"203_CR21","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"J. M. Moore","year":"1968","unstructured":"Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102\u2013109.","journal-title":"Management Science"},{"key":"203_CR22","volume-title":"Scheduling: theory, algorithms, and systems","author":"M. L. Pinedo","year":"2005","unstructured":"Pinedo, M. L. (2005). Scheduling: theory, algorithms, and systems. Berlin: Springer."},{"key":"203_CR23","first-page":"371","volume-title":"IEEE international conference on automation science and engineering","author":"S. Tanaka","year":"2008","unstructured":"Tanaka, S., & Fujikama, S. (2008). An efficient exact algorithm for general single-machine scheduling with machine idle time. In IEEE international conference on automation science and engineering (pp. 371\u2013376)."},{"key":"203_CR24","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1287\/opre.47.6.862","volume":"47","author":"J. M. Akker Van\u00a0den","year":"1999","unstructured":"Van\u00a0den Akker, J. M., Hoogeveen, J. A., & Van\u00a0de Velde, S. L. (1999). Parallel machine scheduling by column generation. Operations Research, 47, 862\u2013872.","journal-title":"Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0203-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0203-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0203-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:45Z","timestamp":1559453985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0203-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,5]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["203"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0203-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,5]]}}}