default search action
Search dblp for Publications
export results for "toc:db/journals/anor/anor213.bht:"
@article{DBLP:journals/anor/BerghmanLS14, author = {Lotte Berghman and Roel Leus and Frits C. R. Spieksma}, title = {Optimal solutions for a dock assignment problem with trailer transportation}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {3--25}, year = {2014}, url = {https://doi.org/10.1007/s10479-011-0971-7}, doi = {10.1007/S10479-011-0971-7}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/BerghmanLS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/CreemersDV14, author = {Stefan Creemers and Erik Demeulemeester and Stijn Van de Vonder}, title = {A new approach for quantitative risk analysis}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {27--65}, year = {2014}, url = {https://doi.org/10.1007/s10479-013-1355-y}, doi = {10.1007/S10479-013-1355-Y}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/CreemersDV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/CroceGS14, author = {Federico Della Croce and Andrea Grosso and Fabio Salassa}, title = {A matheuristic approach for the two-machine total completion time flow shop problem}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {67--78}, year = {2014}, url = {https://doi.org/10.1007/s10479-011-0928-x}, doi = {10.1007/S10479-011-0928-X}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/CroceGS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/ElvikisT14, author = {Donatas Elvikis and Vincent T'kindt}, title = {Two-agent scheduling on uniform parallel machines with min-max criteria}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {79--94}, year = {2014}, url = {https://doi.org/10.1007/s10479-012-1099-0}, doi = {10.1007/S10479-012-1099-0}, timestamp = {Fri, 16 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/ElvikisT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/FiratHL14, author = {Murat Firat and Cor A. J. Hurkens and Alexandre Laugier}, title = {Stable multi-skill workforce assignments}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {95--114}, year = {2014}, url = {https://doi.org/10.1007/s10479-012-1224-0}, doi = {10.1007/S10479-012-1224-0}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/FiratHL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/GafarovLW14, author = {Evgeny R. Gafarov and Alexander A. Lazarev and Frank Werner}, title = {Approximability results for the resource-constrained project scheduling problem with a single type of resources}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {115--130}, year = {2014}, url = {https://doi.org/10.1007/s10479-012-1106-5}, doi = {10.1007/S10479-012-1106-5}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/GafarovLW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/GawiejnowiczK14, author = {Stanislaw Gawiejnowicz and Alexander V. Kononov}, title = {Isomorphic scheduling problems}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {131--145}, year = {2014}, url = {https://doi.org/10.1007/s10479-012-1222-2}, doi = {10.1007/S10479-012-1222-2}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/GawiejnowiczK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/GuyonLPR14, author = {Olivier Guyon and Pierre Lemaire and Eric Pinson and David Rivreau}, title = {Solving an integrated job-shop problem with human resource constraints}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {147--171}, year = {2014}, url = {https://doi.org/10.1007/s10479-012-1132-3}, doi = {10.1007/S10479-012-1132-3}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/GuyonLPR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/HashemianDV14, author = {Navid Hashemian and Claver Diallo and B{\'{e}}la Vizv{\'{a}}ri}, title = {Makespan minimization for parallel machines scheduling with multiple availability constraints}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {173--186}, year = {2014}, url = {https://doi.org/10.1007/s10479-012-1059-8}, doi = {10.1007/S10479-012-1059-8}, timestamp = {Thu, 23 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/HashemianDV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/HazirK14, author = {{\"{O}}nc{\"{u}} Hazir and Safia Kedad{-}Sidhoum}, title = {Batch sizing and just-in-time scheduling with common due date}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {187--202}, year = {2014}, url = {https://doi.org/10.1007/s10479-012-1289-9}, doi = {10.1007/S10479-012-1289-9}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/HazirK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/HeWL14, author = {Zhengwen He and Nengmin Wang and Pengxiang Li}, title = {Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {203--220}, year = {2014}, url = {https://doi.org/10.1007/s10479-012-1155-9}, doi = {10.1007/S10479-012-1155-9}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/HeWL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/ObeidDY14, author = {Ali Obeid and St{\'{e}}phane Dauz{\`{e}}re{-}P{\'{e}}r{\`{e}}s and Claude Yugma}, title = {Scheduling job families on non-identical parallel machines with time constraints}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {221--234}, year = {2014}, url = {https://doi.org/10.1007/s10479-012-1107-4}, doi = {10.1007/S10479-012-1107-4}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/ObeidDY14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/RozyckiW14, author = {Rafal R{\'{o}}zycki and Jan Weglarz}, title = {Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {235--252}, year = {2014}, url = {https://doi.org/10.1007/s10479-011-0957-5}, doi = {10.1007/S10479-011-0957-5}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/anor/RozyckiW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/SevastyanovCC14, author = {Sergey Sevastyanov and D. A. Chemisova and Ilya Chernykh}, title = {On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {253--270}, year = {2014}, url = {https://doi.org/10.1007/s10479-012-1290-3}, doi = {10.1007/S10479-012-1290-3}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/SevastyanovCC14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/TKindtN14, author = {Vincent T'kindt and Emmanuel N{\'{e}}ron}, title = {Preface}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {1}, year = {2014}, url = {https://doi.org/10.1007/s10479-014-1532-7}, doi = {10.1007/S10479-014-1532-7}, timestamp = {Fri, 16 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/TKindtN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/TianD14, author = {Wendi Tian and Erik Demeulemeester}, title = {Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {271--291}, year = {2014}, url = {https://doi.org/10.1007/s10479-012-1277-0}, doi = {10.1007/S10479-012-1277-0}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/TianD14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/ViergutzK14, author = {Christian Viergutz and Sigrid Knust}, title = {Integrated production and distribution scheduling with lifespan constraints}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {293--318}, year = {2014}, url = {https://doi.org/10.1007/s10479-012-1197-z}, doi = {10.1007/S10479-012-1197-Z}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/ViergutzK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/Waligora14, author = {Grzegorz Walig{\'{o}}ra}, title = {Discrete-continuous project scheduling with discounted cash inflows and various payment models - a review of recent results}, journal = {Ann. Oper. Res.}, volume = {213}, number = {1}, pages = {319--340}, year = {2014}, url = {https://doi.org/10.1007/s10479-011-1014-0}, doi = {10.1007/S10479-011-1014-0}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/Waligora14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.