{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:02:44Z","timestamp":1730275364614,"version":"3.28.0"},"reference-count":8,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ispan.2002.1004283","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T20:30:39Z","timestamp":1056573039000},"page":"205-209","source":"Crossref","is-referenced-by-count":0,"title":["Multi-player game approach to scheduling problems"],"prefix":"10.1109","author":[{"family":"Wee-Chong Oon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"1020","author":"lim","year":"2000","journal-title":"A Campus-Wide University Examination Timetabling Application in Innovative Applications in Artificial Intelligence (AAAI\/IAAI)"},{"key":"ref3","first-page":"340","volume":"27","author":"lesser","year":"1995","journal-title":"Multiagent Systems An Emerging Subdiscipline of AI in ACM Computing Surveys"},{"key":"ref6","first-page":"235","volume":"75","author":"liu","year":"1997","journal-title":"Coordination of Multiple Agents for Production Management"},{"journal-title":"UTTSExam A Campus-Wide University Exam-Timetabling System submitted to Innovative Applications in Artificial Intelligence (AAAI\/IAAI)","year":"2002","author":"lim","key":"ref5"},{"key":"ref8","first-page":"79","volume":"19","author":"sycara","year":"1998","journal-title":"Multiagent Systems"},{"key":"ref7","article-title":"The OASIS Air-Traffic Management System","author":"ljunberg","year":"0","journal-title":"Proceedings of the Second Pacific Rim International Conference on AI (PRICAI-92)"},{"journal-title":"Introduction to Expert Systems 3rd Ed","year":"1999","author":"jackson","key":"ref2"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref1"}],"event":{"name":"2002 International Symposium on Parallel Architectures, Algorithms, and Networks","acronym":"OSPAN-02","location":"Makati City, Metro Manila, Philippines"},"container-title":["Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7867\/21662\/01004283.pdf?arnumber=1004283","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T18:39:57Z","timestamp":1489171197000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1004283\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":8,"URL":"https:\/\/doi.org\/10.1109\/ispan.2002.1004283","relation":{},"subject":[]}}