{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:59:05Z","timestamp":1743011945841,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642543692"},{"type":"electronic","value":"9783642543708"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54370-8_12","type":"book-chapter","created":{"date-parts":[[2014,2,25]],"date-time":"2014-02-25T06:19:20Z","timestamp":1393309160000},"page":"133-143","source":"Crossref","is-referenced-by-count":1,"title":["A Task Selecting Algorithm for Personal Schedules in Workflow Systems"],"prefix":"10.1007","author":[{"given":"Huan","family":"Yang","sequence":"first","affiliation":[]},{"given":"Jidong","family":"Ge","sequence":"additional","affiliation":[]},{"given":"Quanjiang","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Chuanyi","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zhihong","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.elerap.2004.09.003","volume":"4","author":"H.C. Li","year":"2005","unstructured":"Li, H.C., Yang, Y.: Dynamic checking of temporal constraints for concurrent work-flows. Electronic Commerce Research and Applications\u00a04, 124\u2013142 (2005)","journal-title":"Electronic Commerce Research and Applications"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Karger, D., Stein, C., Wein, J.: Scheduling Algorithms, CRC Handbook of Computer Science. CRC Press (1997)","DOI":"10.1201\/9781420049503-c36"},{"key":"12_CR3","unstructured":"Brucker, P.: Scheduling Algorithms, 5th edn. Springer (2007)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0164-1212(03)00250-4","volume":"73","author":"H.C. Li","year":"2004","unstructured":"Li, H.C., Yang, Y., Chen, T.Y.: Resource constraints analysis of workflow specifications. The Journal of Systems and Software\u00a073, 271\u2013285 (2004)","journal-title":"The Journal of Systems and Software"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/S0377-2217(97)00348-2","volume":"107","author":"A. Sprecher","year":"1998","unstructured":"Sprecher, A., Drexl, A.: Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. European Journal of Operational Research\u00a0107, 431\u2013450 (1998)","journal-title":"European Journal of Operational Research"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/S0377-2217(96)00180-4","volume":"100","author":"M. Mori","year":"1997","unstructured":"Mori, M., Tseng, C.C.: A genetic algorithm for multi-mode resource constrained project scheduling problem. European Journal of Operational Research\u00a0100, 134\u2013141 (1997)","journal-title":"European Journal of Operational Research"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1010902015091","volume":"102","author":"S. Hartmann","year":"2001","unstructured":"Hartmann, S.: Project Scheduling with Multiple Modes: A Genetic Algorithm. Annals of Operations Research\u00a0102, 111\u2013135 (2001)","journal-title":"Annals of Operations Research"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/A:1010954031930","volume":"102","author":"J. J\u00f3zefowska","year":"2001","unstructured":"J\u00f3zefowska, J., Mika, M., R\u00f3\u017cycki, R., Walig\u00f3ra, G., W\u0119glarz, J.: Simulated Annealing for Multi-Mode Resource-Constrained Project Scheduling. Annals of Operations Research\u00a0102, 13\u2013155 (2001)","journal-title":"Annals of Operations Research"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/S0377-2217(02)00761-0","volume":"149","author":"K. Bouleimen","year":"2003","unstructured":"Bouleimen, K., Lecocq, H.: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research\u00a0149, 268\u2013281 (2003)","journal-title":"European Journal of Operational Research"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ijpe.2005.01.003","volume":"101","author":"Y. Gajpal","year":"2006","unstructured":"Gajpal, Y., Rajendran, C.: An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops. International Journal of Production Economics\u00a0101, 259\u2013272 (2006)","journal-title":"International Journal of Production Economics"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/j.cie.2004.12.009","volume":"48","author":"C. Rajendran","year":"2005","unstructured":"Rajendran, C., Ziegler, H.: Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Computers & Industrial Engineering\u00a048, 789\u2013797 (2005)","journal-title":"Computers & Industrial Engineering"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-44895-0_15","volume-title":"Business Process Management","author":"J. Eder","year":"2003","unstructured":"Eder, J., Pichler, H., Gruber, W., Ninaus, M.: Personal Schedules for Workflow Systems. In: van der Aalst, W.M.P., ter Hofstede, A.H.M., Weske, M. (eds.) BPM 2003. LNCS, vol.\u00a02678, pp. 216\u2013231. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2013 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54370-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T21:24:32Z","timestamp":1675977872000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-54370-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642543692","9783642543708"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54370-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}