{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T05:04:11Z","timestamp":1749531851163,"version":"3.37.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,3,21]],"date-time":"2009-03-21T00:00:00Z","timestamp":1237593600000},"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":[[2010,2]]},"DOI":"10.1007\/s10951-009-0106-z","type":"journal-article","created":{"date-parts":[[2009,3,20]],"date-time":"2009-03-20T18:36:48Z","timestamp":1237574208000},"page":"17-38","source":"Crossref","is-referenced-by-count":17,"title":["An improved constraint satisfaction adaptive neural network for job-shop scheduling"],"prefix":"10.1007","volume":"13","author":[{"given":"Shengxiang","family":"Yang","sequence":"first","affiliation":[]},{"given":"Dingwei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Tianyou","family":"Chai","sequence":"additional","affiliation":[]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,3,21]]},"reference":[{"issue":"1","key":"106_CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.cie.2007.04.006","volume":"53","author":"D. E. Akyol","year":"2007","unstructured":"Akyol, D. E., & Bayhan, G. M. (2007). A review on evolution of production scheduling with neural networks. Computers & Industrial Engineering, 53(1), 95\u2013122.","journal-title":"Computers & Industrial Engineering"},{"key":"106_CR2","volume-title":"Introduction to sequence and scheduling","author":"K. R. Baker","year":"1974","unstructured":"Baker, K. R. (1974). Introduction to sequence and scheduling. New York: Wiley."},{"key":"106_CR3","volume-title":"Mathematical aspects of scheduling and applications","author":"R. E. Bellman","year":"1982","unstructured":"Bellman, R. E., Esogbue, A. O., & Nabeshima, I. (1982). Mathematical aspects of scheduling and applications. Oxford: Pergamon."},{"issue":"11","key":"106_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J. E. Beasley","year":"1990","unstructured":"Beasley, J. E. (1990). OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11), 1069\u20131072.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"106_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1999.7.1.1","volume":"7","author":"C. Bierwirth","year":"1999","unstructured":"Bierwirth, C., & Mattfeld, D. C. (1999). Production scheduling and rescheduling with genetic algorithms. Evolutionary Computation, 7(1), 1\u201317.","journal-title":"Evolutionary Computation"},{"key":"106_CR6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207548208947745","volume":"20","author":"J. Blackstone","year":"1982","unstructured":"Blackstone, J., Phillips, D., & Hogg, G. (1982). A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, 20, 27\u201345.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"106_CR7","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/0360-8352(96)00047-2","volume":"30","author":"R. Cheng","year":"1996","unstructured":"Cheng, R., Gen, M., & Tsujimura, Y. (1996). A tutorial survey of job-shop scheduling problems using genetic algorithms, I: representation. Computers & Industrial Engineering, 30(4), 983\u2013997.","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"106_CR8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0360-8352(99)00136-9","volume":"36","author":"R. Cheng","year":"1999","unstructured":"Cheng, R., Gen, M., & Tsujimura, Y. (1999). A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies. Computers & Industrial Engineering, 36(2), 343\u2013364.","journal-title":"Computers & Industrial Engineering"},{"key":"106_CR9","volume-title":"Theory of scheduling","author":"R. W. Conway","year":"1967","unstructured":"Conway, R. W., Maxwell, W. L., & Miller, L. W. (1967). Theory of scheduling. Reading: Addison-Wesley."},{"key":"106_CR10","volume-title":"Introduction to algorithms","author":"T. H. Cormen","year":"1990","unstructured":"Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1990). Introduction to algorithms. Cambridge: MIT Press."},{"key":"106_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF00128646","volume":"6","author":"D. Dubois","year":"1995","unstructured":"Dubois, D., Fargier, H., & Prade, H. (1995). Fuzzy constraints in job-shop scheduling. Journal of Intelligent Manufacturing, 6, 215\u2013234.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"4","key":"106_CR12","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1287\/opre.24.4.774","volume":"24","author":"J. Erschler","year":"1976","unstructured":"Erschler, J., Roubellat, F., & Vernhes, J. P. (1976). Finding some essential characteristics of the feasible solutions for a scheduling problem. Operations Research, 24(4), 774\u2013783.","journal-title":"Operations Research"},{"key":"106_CR13","unstructured":"Fang, H.-L., Ross, P., & Corne, D. (1993). A promising genetic algorithm approach to job-shop scheduling, rescheduling and open-shop scheduling problems. In Proceedings of the 5th international conference on genetic algorithms (pp. 375\u2013382)."},{"key":"106_CR14","doi-asserted-by":"crossref","unstructured":"Foo, S. Y., & Takefuji, Y. (1988a). Neural networks for solving job-shop scheduling, part 1: problem representation. In Proceedings of the 2nd IEEE international joint conference on neural networks (Vol.\u00a02, pp. 275\u2013282).","DOI":"10.1109\/ICNN.1988.23939"},{"key":"106_CR15","doi-asserted-by":"crossref","unstructured":"Foo, S. Y., & Takefuji, Y. (1988b). Stochastic neural networks for solving job-shop scheduling, part 2: architecture and simulations. In Proceedings of the 2nd IEEE international joint conference on neural networks (Vol. 2, pp. 283\u2013290).","DOI":"10.1109\/ICNN.1988.23940"},{"issue":"3","key":"106_CR16","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0952-1976(94)90059-0","volume":"7","author":"S. Y. Foo","year":"1994","unstructured":"Foo, S. Y., Takefuji, Y., & Szu, H. (1994). Job-shop scheduling based on modified Tank\u2013Hopfield linear programming networks. Engineering Application of Artificial Intelligence, 7(3), 321\u2013327.","journal-title":"Engineering Application of Artificial Intelligence"},{"key":"106_CR17","volume-title":"Knowledge-based scheduling","author":"M. S. Fox","year":"1993","unstructured":"Fox, M. S., & Zweben, M. (1993). Knowledge-based scheduling. San Mateo: Morgan Kaufmann."},{"key":"106_CR18","volume-title":"Sequencing and scheduling: an introduction to the mathematics of the job-shop","author":"S. French","year":"1982","unstructured":"French, S. (1982). Sequencing and scheduling: an introduction to the mathematics of the job-shop. New York: Wiley."},{"issue":"2","key":"106_CR19","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M. R. Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and job-shop scheduling. Mathematics of Operations Research, 1(2), 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"key":"106_CR20","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B. Giffler","year":"1960","unstructured":"Giffler, B., & Thompson, G. (1960). Algorithms for solving production scheduling problems. Operations Research, 8, 487\u2013503.","journal-title":"Operations Research"},{"key":"106_CR21","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 Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 4, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"24","key":"106_CR22","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1287\/opre.29.4.646","volume":"29","author":"S. C. Graves","year":"1981","unstructured":"Graves, S. C. (1981). A review of production scheduling. Operations Research, 29(24), 646\u2013675.","journal-title":"Operations Research"},{"key":"106_CR23","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1007\/BFb0056926","volume-title":"Proceedings of the 5th international conference on parallel problem solving from nature (PPSN V)","author":"E. Hart","year":"1998","unstructured":"Hart, E., & Ross, P. (1998). A heuristic combination method for solving job-shop scheduling problems. In Lecture notes in computer science : Vol.\u00a01498. Proceedings of the 5th international conference on parallel problem solving from nature (PPSN V) (pp. 845\u2013854). Berlin: Springer."},{"key":"106_CR24","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10710-005-7580-7","volume":"6","author":"E. Hart","year":"2005","unstructured":"Hart, E., Ross, P., & Corne, D. (2005). Evolutionary scheduling: a review. Genetic Programming and Evolvable Machines, 6, 191\u2013220.","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"106_CR25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01721162","volume":"11","author":"R. Haupt","year":"1989","unstructured":"Haupt, R. (1989). A survey of priority-rule based scheduling problem. OR Spektrum, 11, 3\u201316.","journal-title":"OR Spektrum"},{"key":"106_CR26","volume-title":"Neural networks a comprehensive foundation","author":"S. Haykin","year":"1999","unstructured":"Haykin, S. (1999). Neural networks a comprehensive foundation (2nd ed.). London: Prentice Hall International.","edition":"2"},{"key":"106_CR27","volume-title":"Constraint satisfaction and logic programming","author":"P. V. Hentenryck","year":"1989","unstructured":"Hentenryck, P. V. (1989). Constraint satisfaction and logic programming. Cambridge: MIT Press."},{"key":"106_CR28","unstructured":"Lawrence, S. (1984). Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA."},{"key":"106_CR29","unstructured":"Lin, S.-C., Goodman, E. D., & Punch, W. F. (1997). A genetic algorithm approach to dynamic job-shop scheduling problems. In Proceedings of the 7th international conference on genetic algorithms (pp. 481\u2013489)."},{"issue":"1","key":"106_CR30","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/70.833193","volume":"16","author":"P. B. Luh","year":"2000","unstructured":"Luh, P. B., Zhao, X., Wang, Y., & Thakur, L. S. (2000). Lagrangian relaxation neural networks for job shop scheduling. IEEE Transactions on Robotics and Automation, 16(1), 78\u201388.","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"106_CR31","doi-asserted-by":"crossref","unstructured":"V\u00e1zquez, M., & Whitley, L. D. (2000a). A comparison of genetic algorithms for the static job shop scheduling problem. In Proceedings of the 6th international conference on parallel problem solving from nature (PPSN VI) (pp. 303\u2013312).","DOI":"10.1007\/3-540-45356-3_30"},{"key":"106_CR32","doi-asserted-by":"crossref","unstructured":"V\u00e1zquez, M., & Whitley, L. D. (2000b). A comparison of genetic algorithms for the dynamic job shop scheduling problem. In Proceedings of the 2000 genetic and evolutionary computation conference (pp. 1011\u20131018).","DOI":"10.1007\/3-540-45356-3_30"},{"issue":"1","key":"106_CR33","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0967-0661(94)90571-1","volume":"2","author":"T. M. Willems","year":"1994","unstructured":"Willems, T. M. (1994). Neural networks for job-shop scheduling. Control Engineering Practice, 2(1), 31\u201339.","journal-title":"Control Engineering Practice"},{"key":"106_CR34","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF00124064","volume":"6","author":"T. M. Willems","year":"1995","unstructured":"Willems, T. M., & Brandts, L. E. M. W. (1995). Implementing heuristics as an optimization criterion in neural networks for job-shop scheduling. Journal of Intelligent Manufacturing, 6, 377\u2013387.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"106_CR35","doi-asserted-by":"crossref","unstructured":"Yang, S. (2005). An improved adaptive neural network for job-shop scheduling. In Proceedings of the 2005 IEEE international conference on systems, man and cybernetics (Vol. 2, pp. 1200\u20131205).","DOI":"10.1109\/ICSMC.2005.1571309"},{"key":"106_CR36","doi-asserted-by":"crossref","unstructured":"Yang, S. (2006). Job-shop scheduling with an adaptive neural network and local search hybrid approach. In Proceedings of the 2006 IEEE international joint conference on neural networks (pp.\u00a02720\u20132727).","DOI":"10.1109\/IJCNN.2006.247176"},{"issue":"2","key":"106_CR37","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1109\/72.839016","volume":"11","author":"S. Yang","year":"2000","unstructured":"Yang, S., & Wang, D. (2000). Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling. IEEE Transactions on Neural Networks, 11(2), 474\u2013486.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"10","key":"106_CR38","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1016\/S0305-0548(00)00018-6","volume":"28","author":"S. Yang","year":"2001","unstructured":"Yang, S., & Wang, D. (2001). A new adaptive neural network and heuristics hybrid approach for job-shop scheduling. Computers & Operations Research, 28(10), 955\u2013971.","journal-title":"Computers & Operations Research"},{"key":"106_CR39","unstructured":"Yu, H. (1997). Research of intelligent production scheduling methods and their applications. PhD thesis, Northeastern University, China."},{"key":"106_CR40","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0360-8352(01)00010-9","volume":"39","author":"H. Yu","year":"2001","unstructured":"Yu, H., & Liang, W. (2001). Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling. Computers & Industrial Engineering, 39, 337\u2013356.","journal-title":"Computers & Industrial Engineering"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0106-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0106-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0106-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T16:16:27Z","timestamp":1739031387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0106-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,21]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["106"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0106-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2009,3,21]]}}}