A robust approach for the single machine scheduling problem. Briand, C., La, H. T., & Erschler, J. J. Sched., 10(3):209–221, 2007.
Paper doi bibtex @article{DBLP:journals/scheduling/BriandLE07,
author = {Cyril Briand and
Hoang Trung La and
Jacques Erschler},
title = {A robust approach for the single machine scheduling problem},
journal = {J. Sched.},
volume = {10},
number = {3},
pages = {209--221},
year = {2007},
url = {https://doi.org/10.1007/s10951-007-0010-3},
doi = {10.1007/s10951-007-0010-3},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BriandLE07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"bfr96yJtwJSF9MMM2","bibbaseid":"briand-la-erschler-arobustapproachforthesinglemachineschedulingproblem-2007","downloads":0,"creationDate":"2016-12-19T20:50:58.705Z","title":"A robust approach for the single machine scheduling problem","author_short":["Briand, C.","La, H. T.","Erschler, J."],"year":2007,"bibtype":"article","biburl":"https://dblp.org/pid/72/6179.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Cyril"],"propositions":[],"lastnames":["Briand"],"suffixes":[]},{"firstnames":["Hoang","Trung"],"propositions":[],"lastnames":["La"],"suffixes":[]},{"firstnames":["Jacques"],"propositions":[],"lastnames":["Erschler"],"suffixes":[]}],"title":"A robust approach for the single machine scheduling problem","journal":"J. Sched.","volume":"10","number":"3","pages":"209–221","year":"2007","url":"https://doi.org/10.1007/s10951-007-0010-3","doi":"10.1007/s10951-007-0010-3","timestamp":"Wed, 01 Apr 2020 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/scheduling/BriandLE07.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/scheduling/BriandLE07,\n author = {Cyril Briand and\n Hoang Trung La and\n Jacques Erschler},\n title = {A robust approach for the single machine scheduling problem},\n journal = {J. Sched.},\n volume = {10},\n number = {3},\n pages = {209--221},\n year = {2007},\n url = {https://doi.org/10.1007/s10951-007-0010-3},\n doi = {10.1007/s10951-007-0010-3},\n timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/scheduling/BriandLE07.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Briand, C.","La, H. T.","Erschler, J."],"key":"DBLP:journals/scheduling/BriandLE07","id":"DBLP:journals/scheduling/BriandLE07","bibbaseid":"briand-la-erschler-arobustapproachforthesinglemachineschedulingproblem-2007","role":"author","urls":{"Paper":"https://doi.org/10.1007/s10951-007-0010-3"},"downloads":0},"search_terms":["robust","approach","single","machine","scheduling","problem","briand","la","erschler"],"keywords":["algorithms","interval structures","pyramids","robustness","scheduling","sequencing and scheduling","sequential flexibility","theory"],"authorIDs":[],"dataSources":["gFvghkfp8ZY6n3ohX"]}