%0 Journal Article %1 journals/scheduling/PiraA16 %A Pira, Clément %A Artigues, Christian %D 2016 %J J. Sched. %K dblp %N 3 %P 227-243 %T Line search method for solving a non-preemptive strictly periodic scheduling problem. %U http://dblp.uni-trier.de/db/journals/scheduling/scheduling19.html#PiraA16 %V 19

@article{journals/scheduling/PiraA16, added-at = {2020-04-01T00:00:00.000+0200}, author = {Pira, Clément and Artigues, Christian}, biburl = {https://www.bibsonomy.org/bibtex/2a50664232880473cd4ad4cd6e7393f1c/dblp}, ee = {https://doi.org/10.1007/s10951-014-0389-6}, interhash = {39b7462634dd2eb2642b9721e0337fc8}, intrahash = {a50664232880473cd4ad4cd6e7393f1c}, journal = {J. Sched.}, keywords = {dblp}, number = 3, pages = {227-243}, timestamp = {2020-04-02T12:05:07.000+0200}, title = {Line search method for solving a non-preemptive strictly periodic scheduling problem.}, url = {http://dblp.uni-trier.de/db/journals/scheduling/scheduling19.html#PiraA16}, volume = 19, year = 2016 }