{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:22:18Z","timestamp":1761895338655},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,9,21]],"date-time":"2011-09-21T00:00:00Z","timestamp":1316563200000},"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":[[2012,6]]},"DOI":"10.1007\/s10951-011-0252-y","type":"journal-article","created":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T20:50:42Z","timestamp":1316551842000},"page":"311-321","source":"Crossref","is-referenced-by-count":35,"title":["Single-machine multi-agent scheduling problems with a global objective function"],"prefix":"10.1007","volume":"15","author":[{"given":"N.","family":"Huynh\u00a0Tuong","sequence":"first","affiliation":[]},{"given":"A.","family":"Soukhal","sequence":"additional","affiliation":[]},{"given":"J.-C.","family":"Billaut","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,9,21]]},"reference":[{"key":"252_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1023\/A:1009637419820","volume":"6","author":"A. Agnetis","year":"2000","unstructured":"Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2000). Nondominated schedules for a job-shop with two competing users. Computational and Mathematical Organization Theory, 6, 191\u2013217.","journal-title":"Computational and Mathematical Organization Theory"},{"key":"252_CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A. Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52, 229\u2013242.","journal-title":"Operations Research"},{"key":"252_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-006-0164-y","volume":"150","author":"A. Agnetis","year":"2007","unstructured":"Agnetis, A., Pacciarelli, D., & Pacifici, A. (2007). Multi-agent single machine scheduling. Annals of Operations Research, 150, 3\u201315.","journal-title":"Annals of Operations Research"},{"key":"252_CR4","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"K. Baker","year":"2003","unstructured":"Baker, K., & Smith, J. C. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7\u201316.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"252_CR5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.ejor.2008.10.038","volume":"199","author":"H. Balasubramanian","year":"2009","unstructured":"Balasubramanian, H., Fowler, J., Keha, A., & Pfund, M. (2009). Scheduling interfering job sets on parallel machines. European Journal of Operational Research, 199(1), 55\u201367.","journal-title":"European Journal of Operational Research"},{"key":"252_CR6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","volume":"362","author":"T. C. E. Cheng","year":"2006","unstructured":"Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2006). Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoretical Computer Science, 362, 273\u2013281.","journal-title":"Theoretical Computer Science"},{"key":"252_CR7","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.ejor.2007.04.040","volume":"188","author":"T. C. E. Cheng","year":"2008","unstructured":"Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2008). Multi-agent scheduling on a single machine with max-form criteria. European Journal of Operational Research, 188, 603\u2013609.","journal-title":"European Journal of Operational Research"},{"key":"252_CR8","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: W.H.\u00a0Freeman."},{"key":"252_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy\u00a0Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"3","key":"252_CR10","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1287\/opre.1030.0101","volume":"52","author":"N. G. Hall","year":"2004","unstructured":"Hall, N. G., & Potts, C. N. (2004). Rescheduling for new orders. Operations Research, 52(3), 440\u2013453 +496.","journal-title":"Operations Research"},{"key":"252_CR11","unstructured":"Hoogeveen, H. (1992). Single machine bicriteria scheduling. PhD Thesis, Amsterdam."},{"key":"252_CR12","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"H. Hoogeveen","year":"2005","unstructured":"Hoogeveen, H. (2005). Multicriteria scheduling. European Journal of Operational Research, 167, 592\u2013623.","journal-title":"European Journal of Operational Research"},{"key":"252_CR13","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0167-6377(95)00023-D","volume":"17","author":"H. Hoogeveen","year":"1995","unstructured":"Hoogeveen, H., & Van\u00a0de Velde, S. (1995). Minimizing completion time and maximum cost simultaneously is solvable in polynomial time. Operations Research Letters, 17, 205\u2013208.","journal-title":"Operations Research Letters"},{"key":"252_CR14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.orl.2006.01.007","volume":"35","author":"Y. Huo","year":"2007","unstructured":"Huo, Y., Leung, J. Y.-T., & Zhao, H. (2007). Complexity of two dual criteria scheduling problems. Operations Research Letters, 35, 211\u2013220.","journal-title":"Operations Research Letters"},{"key":"252_CR15","unstructured":"Huynh Tuong, N., Soukhal, A., & Billaut, J.-C. (2009). Complexity of partition problem with distinct elements (Research report num. 295), University of Tours, France, March."},{"key":"252_CR16","first-page":"907","volume-title":"IEEE international conference on service systems and service management (IEEE-SSSM\u201906)","author":"C. Mocquillon","year":"2006","unstructured":"Mocquillon, C., Lent\u00e9, C., & T\u2019Kindt, V. (2006). Solution of a multicriteria shampoo production problem. In IEEE international conference on service systems and service management (IEEE-SSSM\u201906), Troyes (France) (pp. 907\u2013911)."},{"issue":"4","key":"252_CR17","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/mnsc.32.4.464","volume":"32","author":"R. T. Nelson","year":"1986","unstructured":"Nelson, R. T., Sarin, R. K., & Daniels, R. L. (1986). Scheduling with multiple performance measures: the one-machine case. Management Science, 32(4), 464\u2013479.","journal-title":"Management Science"},{"key":"252_CR18","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10878-006-9001-0","volume":"12","author":"C. T. Ng","year":"2006","unstructured":"Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2006). A note on the complexity of the problem of two-agent scheduling on a single machine. Journal of Combinatorial Optimization, 12, 387\u2013394.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"252_CR19","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1504\/EJIE.2008.017349","volume":"2","author":"C. Pessan","year":"2008","unstructured":"Pessan, C., Bouquard, J.-L., & Neron, E. (2008a). An unrelated parallel machines model for an industrial production resetting problem. European Journal of Industrial Engineering, 2(2), 153\u2013171.","journal-title":"European Journal of Industrial Engineering"},{"key":"252_CR20","first-page":"136","volume-title":"Lecture notes in computer science","author":"C. Pessan","year":"2008","unstructured":"Pessan, C., Bouquard, J.-L., & Neron, E. (2008b). Genetic branch-and-bound or exact genetic algorithm. In Lecture notes in computer science (Vol. 4926, pp. 136\u2013147). Berlin: Springer."},{"key":"252_CR21","volume-title":"Multicriteria scheduling: theory, models and algorithms","author":"V. T\u2019kindt","year":"2006","unstructured":"T\u2019kindt, V., & Billaut, J.-C. (2006). Multicriteria scheduling: theory, models and algorithms (2nd ed.). Berlin: Springer.","edition":"2"},{"issue":"1","key":"252_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0305-0548(93)90091-V","volume":"20","author":"S. D. Wu","year":"1993","unstructured":"Wu, S. D., Storer, R. H., & Chang, P.-C. (1993). One-machine rescheduling heuristics with efficiency and stability as criteria. Computers & Operations Research, 20(1), 1\u201314.","journal-title":"Computers & Operations Research"},{"key":"252_CR23","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10951-005-4997-z","volume":"8","author":"J. J. Yuan","year":"2005","unstructured":"Yuan, J. J., Shang, W. P., & Feng, Q. (2005). A note on the scheduling with two families of jobs. Journal of Scheduling, 8, 537\u2013542.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0252-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0252-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0252-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:46Z","timestamp":1559468386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0252-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,21]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["252"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0252-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,21]]}}}