Variable neighborhood search for the pharmacy duty scheduling problem. Kocatürk, F. & Özpeynirci, Ö. Computers & Operations Research, 51:218-226, Elsevier, 11, 2014.
Paper
Website bibtex @article{
title = {Variable neighborhood search for the pharmacy duty scheduling problem},
type = {article},
year = {2014},
identifiers = {[object Object]},
keywords = {PDS,Pharmacy duty scheduling,VNDS,VNRS,VNS,Variable neighborhood decomposition search,Variable neighborhood restricted search,Variable neighborhood search,pharmacy duty scheduling,variable neighborhood restricted search,variable neighborhood search},
pages = {218-226},
volume = {51},
websites = {http://linkinghub.elsevier.com/retrieve/pii/S0305054814001580},
month = {11},
publisher = {Elsevier},
id = {d5ac6780-a10c-3b08-809e-5612adfd1577},
created = {2015-03-23T18:50:23.000Z},
accessed = {2014-09-02},
file_attached = {true},
profile_id = {756a70ce-605d-3e50-9cbb-a99c29afcbe8},
group_id = {1f5b486a-d8ac-3a35-9104-56111360dab7},
last_modified = {2017-03-14T11:36:44.206Z},
read = {true},
starred = {false},
authored = {false},
confirmed = {true},
hidden = {false},
citation_key = {Kocaturk2014a},
private_publication = {false},
bibtype = {article},
author = {Kocatürk, Fatih and Özpeynirci, Özgür},
journal = {Computers & Operations Research}
}
Downloads: 0
{"_id":"4YgKjNs9hnYZuXPNA","bibbaseid":"kocatrk-zpeynirci-variableneighborhoodsearchforthepharmacydutyschedulingproblem-2014","downloads":0,"creationDate":"2018-03-26T07:07:40.618Z","title":"Variable neighborhood search for the pharmacy duty scheduling problem","author_short":["Kocatürk, F.","Özpeynirci, Ö."],"year":2014,"bibtype":"article","biburl":null,"bibdata":{"title":"Variable neighborhood search for the pharmacy duty scheduling problem","type":"article","year":"2014","identifiers":"[object Object]","keywords":"PDS,Pharmacy duty scheduling,VNDS,VNRS,VNS,Variable neighborhood decomposition search,Variable neighborhood restricted search,Variable neighborhood search,pharmacy duty scheduling,variable neighborhood restricted search,variable neighborhood search","pages":"218-226","volume":"51","websites":"http://linkinghub.elsevier.com/retrieve/pii/S0305054814001580","month":"11","publisher":"Elsevier","id":"d5ac6780-a10c-3b08-809e-5612adfd1577","created":"2015-03-23T18:50:23.000Z","accessed":"2014-09-02","file_attached":"true","profile_id":"756a70ce-605d-3e50-9cbb-a99c29afcbe8","group_id":"1f5b486a-d8ac-3a35-9104-56111360dab7","last_modified":"2017-03-14T11:36:44.206Z","read":"true","starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"Kocaturk2014a","private_publication":false,"bibtype":"article","author":"Kocatürk, Fatih and Özpeynirci, Özgür","journal":"Computers & Operations Research","bibtex":"@article{\n title = {Variable neighborhood search for the pharmacy duty scheduling problem},\n type = {article},\n year = {2014},\n identifiers = {[object Object]},\n keywords = {PDS,Pharmacy duty scheduling,VNDS,VNRS,VNS,Variable neighborhood decomposition search,Variable neighborhood restricted search,Variable neighborhood search,pharmacy duty scheduling,variable neighborhood restricted search,variable neighborhood search},\n pages = {218-226},\n volume = {51},\n websites = {http://linkinghub.elsevier.com/retrieve/pii/S0305054814001580},\n month = {11},\n publisher = {Elsevier},\n id = {d5ac6780-a10c-3b08-809e-5612adfd1577},\n created = {2015-03-23T18:50:23.000Z},\n accessed = {2014-09-02},\n file_attached = {true},\n profile_id = {756a70ce-605d-3e50-9cbb-a99c29afcbe8},\n group_id = {1f5b486a-d8ac-3a35-9104-56111360dab7},\n last_modified = {2017-03-14T11:36:44.206Z},\n read = {true},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {Kocaturk2014a},\n private_publication = {false},\n bibtype = {article},\n author = {Kocatürk, Fatih and Özpeynirci, Özgür},\n journal = {Computers & Operations Research}\n}","author_short":["Kocatürk, F.","Özpeynirci, Ö."],"urls":{"Paper":"https://bibbase.org/service/mendeley/756a70ce-605d-3e50-9cbb-a99c29afcbe8/file/6dabe0c7-f6ff-3e0d-469b-ce5dee39c010/2014-Variable_neighborhood_search_for_the_pharmacy_duty_scheduling_problem.pdf.pdf","Website":"http://linkinghub.elsevier.com/retrieve/pii/S0305054814001580"},"bibbaseid":"kocatrk-zpeynirci-variableneighborhoodsearchforthepharmacydutyschedulingproblem-2014","role":"author","keyword":["PDS","Pharmacy duty scheduling","VNDS","VNRS","VNS","Variable neighborhood decomposition search","Variable neighborhood restricted search","Variable neighborhood search","pharmacy duty scheduling","variable neighborhood restricted search","variable neighborhood search"],"downloads":0},"search_terms":["variable","neighborhood","search","pharmacy","duty","scheduling","problem","kocatürk","özpeynirci"],"keywords":["pds","pharmacy duty scheduling","vnds","vnrs","vns","variable neighborhood decomposition search","variable neighborhood restricted search","variable neighborhood search","pharmacy duty scheduling","variable neighborhood restricted search","variable neighborhood search"],"authorIDs":[]}