{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"Algorithm_PersonnelAssignment","description":"","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/8\/8cba0c126d6fc2ca\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='405' id='ccShare961' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/961' allowfullscreen><\/iframe>","type":"video","width":720,"height":405,"duration":"15:44","index":{"item_1":{"title":"Personnel Assignment Problem","time":"0","indent":"0","sn":"1"},"item_2":{"title":"Personnel Assignment Problem","time":"20890","indent":"0","sn":"2"},"item_3":{"title":"e.g. A partial ordering of jobsAfter topological sorting, one of the following topologically sorted sequences will be generated:One of feasible assignments:P1\u2192J1, P2\u2192J2, P3\u2192J3, P4\u2192J4","time":"165740","indent":"0","sn":"3"},"item_4":{"title":"A Solution Tree","time":"277740","indent":"0","sn":"4"},"item_5":{"title":"Cost Matrix","time":"354090","indent":"0","sn":"5"},"item_6":{"title":"Reduced Cost Matrix","time":"554140","indent":"0","sn":"6"},"item_7":{"title":"Cost Matrix","time":"575390","indent":"0","sn":"7"},"item_8":{"title":"Reduced Cost Matrix","time":"577290","indent":"0","sn":"8"},"item_9":{"title":"Slide 7","time":"677940","indent":"0","sn":"9"},"item_10":{"title":"Branch-and-Bound for the Personnel Assignment Problem","time":"714540","indent":"0","sn":"10"},"item_11":{"title":"Slide 7","time":"856290","indent":"0","sn":"11"},"item_12":{"title":"Reduced Cost Matrix","time":"857490","indent":"0","sn":"12"},"item_13":{"title":"Cost Matrix","time":"859240","indent":"0","sn":"13"},"item_14":{"title":"Reduced Cost Matrix","time":"870540","indent":"0","sn":"14"},"item_15":{"title":"Slide 7","time":"870990","indent":"0","sn":"15"},"item_16":{"title":"Branch-and-Bound for the Personnel Assignment Problem","time":"871840","indent":"0","sn":"16"},"item_17":{"title":"The Traveling Salesperson Optimization Problem","time":"938990","indent":"0","sn":"17"}},"resolution":{"playtype":"fs","subtype":"","src":"1280x720","mp4":"720x404","mp4_hd":"1280x720","mp4_4k":"","mp4_1920":"","mp4_src":"","mp4_base":""},"base_image":{"thumb":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/8\/8cba0c126d6fc2ca\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/8\/8cba0c126d6fc2ca\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/8\/8cba0c126d6fc2ca\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/8\/8cba0c126d6fc2ca","status":true}