<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd" xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>00000ctm a22000003a 4500</leader>
  <controlfield tag="001">UP-8027390931316151825</controlfield>
  <controlfield tag="003">Buklod</controlfield>
  <controlfield tag="005">20080205144850.0</controlfield>
  <controlfield tag="006">a     r    |||| u|</controlfield>
  <controlfield tag="007">ta</controlfield>
  <controlfield tag="008">080205s        xx     d     r    |||| u|</controlfield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(iLib)UPMIN-00000518118</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">DLC</subfield>
   <subfield code="c">DLC</subfield>
   <subfield code="d">upmin</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2="0">
   <subfield code="a">LG993.5 2007</subfield>
   <subfield code="b">A64 S43</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Sebastian, Anna Jean L.</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Binary goal programming approach to nurse scheduling problem in Davao medical Center.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
   <subfield code="c">2007</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">84 leaves.</subfield>
  </datafield>
  <datafield tag="502" ind1=" " ind2=" ">
   <subfield code="a">Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2007</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">A 0-1 goal in programming model on nurse scheduling problem in Davao Medical Center was developed. The formulation of the model is based on the surveys and interviews conducted on particular respondents in DMC. The model minimizes the deviations from the corresponding goals subject to hospital policies and nurses? preferences. This model was applied to two sets of nurses: four regular nurse aids and four nurses (consisting of two contractual and regular nurses). The model generated schedule shows: lesser number of isolated days off, lesser number of assigned night shifts, and little difference in the distribution of shifts between nurses. The binary goal programming model that has been developed can aid head nurses in scheduling by offering a template of schedules where hospital policies are satisfied and nurses? preferences are considered.</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
   <subfield code="a">Goal programming.</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
   <subfield code="a">Nurse scheduling</subfield>
   <subfield code="x">Problems.</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
   <subfield code="a">Goal Programming</subfield>
   <subfield code="x">Binary.</subfield>
  </datafield>
  <datafield tag="658" ind1=" " ind2=" ">
   <subfield code="a">Undergraduate Thesis</subfield>
   <subfield code="c">AMAT200</subfield>
   <subfield code="2">BSAM.</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">FI</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">UP</subfield>
  </datafield>
  <datafield tag="852" ind1="0" ind2=" ">
   <subfield code="a">UPMIN</subfield>
   <subfield code="b">UPMIN-MAIN</subfield>
   <subfield code="h">LG993.5 2007</subfield>
   <subfield code="i">A64 S43</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
   <subfield code="a">Thesis</subfield>
  </datafield>
 </record>
</collection>
