เอกสารการประชุมวิชาการและเสนอผลงานวิจัย มหาวิทยาลัยทักษิณ ครั้งที่ 19 2552 - page 1026

„µ¦ž¦³»¤ª·µ„µ¦Â¨³Áœ°Ÿ¨Šµœª·‹´¥¤®µª·š¥µ¨´¥š´ „¬·– ‡¦´Ê Šš¸É 19 ž¦³‹Îµže 2552
4
¦³„È‹³‡oœ®µ˜µ¦µŠš¸É Ä®oŸ¨‡³Âœœ—¸š¸É »— Áž}œŸ¨¨´¡›r¨³®µ„¦³Å—o ¦´Áª¨µÄœ„µ¦‡oœ®µš¸ÉÁ¡·É¤ ¹Êœ Ÿ¨¨´¡›rš¸É
ŗo „È‹³¤¸ ‡³Âœœš¸É—¸¹Ê œÁ¦ºÉ°¥Ç ˜n ®µ„¦³˜o °Š®¥» —šÎ µŠµœ¨ŠŸ¨¨´¡›r š¸É ŗo „È‹³Áž} œŸ¨š¸É—¸š¸É »—š¸É ¦³®µ
ŗo ĜÁª¨µœ´Êœ
¦»žŸ¨„µ¦ª·‹´¥
Šµœª·‹´¥œ¸Ê¤¸ª´˜™»ž¦³Š‡r ®¨´„Á¡ºÉ °«¹„¬µª·Á‡¦µ³®r ¨³¡´ •œµ¦³µ¦œÁš« Á¡ºÉ°nª¥Äœ„µ¦Â„ož{®µÄœ
¦³„µ¦‹´ —„µ¦° °Š‡–³ª·«ª„¦¦¤«µ˜¦r ¤®µª·š¥µ¨´¥Š ¨µœ‡¦·š¦r ¦³š¸É‹³¡´•œµ ¹Êœ‹³œÎ µÁš‡ÃœÃ¨¥¸
„µ¦‡oœ®µ ¨³„µ¦Äo ÁŠºÉ°œÅ Â Ȋ ¨³Â°n °œ¤µÄo š´ÊŠœ¸Ê ÁŠºÉ°œÅ Â È Šœ´Êœ‹³Áž} œÁŠºÉ°œÅ š¸É¦³‹³
¨³Á¤·—Ťn ŗo ¨³ÁŠºÉ°œÅ °n°œœ´Ê œ‹³Áž}œÁŠºÉ °œÅ š¸É ¦³µ¤µ¦™¨³Á¤·—Å—o ˜n °µ‹‹³Á¸¥‡³Âœœ Ÿ¨¨´¡›rš¸É ŗo
»—šoµ¥‹³Å—o‹µ„µ¦‡oœ®µ˜µ¦µŠš¸É ¤¸„µ¦¨³Á¤·—„’œo°¥š¸É »— °¸„œ´¥®œ¹ÉŠ‡º°˜µ¦µŠš¸ÉÁ¸¥‡³Âœœœo°¥š¸É »—œ´ÊœÁ°Š ¦³
š¸É ¡´ •œµ ¹Ê œ‹³Ã—œš—°„µ¦Äo ŠµœÃ—¥Á‹o µ®œoµš¸É®œn ª¥š³Á¸¥œŸ¼očo Šµœ¦³ ¨³‡–³„¦¦¤„µ¦‡»¤°
Á¡ºÉ°œÎµÅžÁž}œ o°¤¼¨Äœ„µ¦¡´•œµ¦³˜n°Åž
‡Îµ °‡»–
Šµœª·‹´¥œ¸Ê ŗo¦´š»œœ´œ»œ‹µ„‡–³ª· «ª„¦¦¤«µ˜¦r ¤®µª·š¥µ¨´¥Š ¨µœ‡¦·œš¦r £µ¥Ä˜o ´µÁ¨ š¸É
ENG-52-2-7-18-0052-S
Á°„µ¦°oµŠ°·Š
Aickelin, U. and Dowsland, K., (2001). “Exploiting problem structure in a genetic algorithm approach to a nurse
rostering problem”, Journal of Scheduling. 3(3):139-153.
Berrada, I., Ferland, J.A., and Michelon, P., (1996). “A multi-objective approach to nurse scheduling with both
hard and soft constraints”, Socio-Economic Planning Science . 30(20): 183-193.
Burke, E., Causmaecker, P.D., and Berghe, G.V., (1999). “A hybrid tabu search algorithm for the nurse rostering
problem”, X. Yao et al. (Eds). SEAL’98 , LNCS:1585, 187-194.
Chen, J.G., and Yeung, T.W., (1993). “Hybrid expert-system approach to nurse scheduling”, Computers in
Nursing. 11:183-190.
Cheang, B., Li, H., Lim, A., and Rodrigues, B., (2003). “Nurse rostering problems—a bibliographic survey”,
European Journal of Operational Research. 151, 447-460.