Articles

Ongoing research

  1. A generic method to solve scheduling problems with inventory constraints, with Roel Leus and Patrick De Causmaecker.

  2. Minimizing makespan in a single machine scheduling problem with release dates and inventory constraints, with Mohammad Ranjbar, Roel Leus and Patrick De Causmaecker.

  3. A smart schedule selection technique for the proactive and reactive resource-constrained project scheduling problem, with Erik Demeulemeester and Patrick De Causmaecker.

  4. A dynamic programming method to solve a general resource-constrained scheduling problem, with Stefan Creemers.

Submitted papers
  1. Morteza Davari, Erik Demeulemeester and Patrick De Causmaecker A novel branch-and-bound algorithm for the chance-constrained problems with finite and discrete support 2016

  2. Morteza Davari and Erik Demeulemeester, The proactive and reactive resource-constrained project scheduling problem: the crucial role of buffer-based reactions. 2017

Articles in internationally reviewed journals
  1. 1- Morteza Davari and Erik Demeulemeester. The proactive and reactive resource-constrained project scheduling problem. Journal of Scheduling, 2017. DOI BibTeX

    @article{Davari2017,
    	title = "The proactive and reactive resource-constrained project scheduling problem",
    	journal = "Journal of Scheduling",
    	author = "Morteza Davari and Erik Demeulemeester",
    	doi = "10.1007/s10951-017-0553-x",
    	year = 2017
    }
    
  2. 2- Morteza Davari, Erik Demeulemeester, Roel Leus and Fabrice Talla Nobibon. Exact algorithms for single-machine scheduling with time windows and precedence constraints. Journal of Scheduling 19:309-334, 2016. DOI BibTeX

    @article{Davari2015a,
    	title = "Exact algorithms for single-machine scheduling with time windows and precedence constraints",
    	journal = "Journal of Scheduling",
    	volume = 19,
    	issue = 3,
    	pages = "309-334",
    	author = "Morteza Davari and Erik Demeulemeester and Roel Leus and Fabrice Talla Nobibon",
    	doi = "10.1007/s10951-015-0428-y",
    	year = 2016
    }
    
  3. 3- Seyed Morteza Khatami, Mohammad Ranjbar and Morteza Davari. Maximizing service level in a β-robust job shop scheduling model. Journal of Industrial and Systems Engineering 8:61-73, 2015. BibTeX

    @article{Davari2015b,
    	title = "Maximizing service level in a β-robust job shop scheduling model",
    	journal = "Journal of Industrial and Systems Engineering",
    	volume = 8,
    	pages = "61-73",
    	author = "Seyed Morteza Khatami and Mohammad Ranjbar and Morteza Davari",
    	year = 2015
    }
    
  4. 4- Foroogh Abasian, Mohammad Ranjbar, Majid Salari, Morteza Davari and Seyed Morteza Khatami. Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays. Applied Mathematical Modelling 38:3975 - 3986, 2014. DOI BibTeX

    @article{Abasian20143975,
    	title = "Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays",
    	journal = "Applied Mathematical Modelling",
    	volume = 38,
    	number = "15–16",
    	pages = "3975 - 3986",
    	year = 2014,
    	issn = "0307-904X",
    	doi = "10.1016/j.apm.2014.01.006",
    	author = "Foroogh Abasian and Mohammad Ranjbar and Majid Salari and Morteza Davari and Seyed Morteza Khatami",
    	keywords = "Branch-and-bound algorithm",
    	abstract = "Abstract This paper addresses a certain type of scheduling problem that arises when a parallel computation is to be executed on a set of identical parallel processors. It is assumed that if two precedence-related tasks are processed on two different processors, due to the information transferring, there will be a task-dependent communication delay between them. For each task, a processing time, a due date and a weight is given while the goal is to minimize the total weighted late work. An integer linear mathematical programming model and a branch-and-bound algorithm have been developed for the proposed problem. Comparing the results obtained by the proposed branch-and-bound algorithm with those obtained by CPLEX, indicates the effectiveness of the method."
    }
    
  5. 5- Mohammad Ranjbar and Morteza Davari. An exact method for scheduling of the alternative technologies in R&D projects. Computers & Operations Research 40:395 - 405, 2013. DOI BibTeX

    @article{Ranjbar2013395,
    	author = "Mohammad Ranjbar and Morteza Davari",
    	title = "An exact method for scheduling of the alternative technologies in R\&D projects",
    	journal = "Computers \& Operations Research",
    	year = 2013,
    	volume = 40,
    	pages = "395 - 405",
    	number = 1,
    	doi = "10.1016/j.cor.2012.07.005",
    	issn = "0305-0548",
    	keywords = "Project scheduling"
    }
    
  6. 6- Mohammad Ranjbar, Morteza Davari and Roel Leus. Two branch-and-bound algorithms for the robust parallel machine scheduling problem. Computers & Operations Research 39:1652 - 1660, 2012. DOI BibTeX

    @article{Ranjbar20121652,
    	author = "Mohammad Ranjbar and Morteza Davari and Roel Leus",
    	title = "Two branch-and-bound algorithms for the robust parallel machine scheduling problem",
    	journal = "Computers \& Operations Research",
    	year = 2012,
    	volume = 39,
    	pages = "1652 - 1660",
    	number = 7,
    	doi = "10.1016/j.cor.2011.09.019",
    	issn = "0305-0548",
    	keywords = "Robust scheduling"
    }
    

Technical reports
  1. 1- Morteza Davari and Erik Demeulemeester. A novel branch-and-bound algorithm for the chance-constrained RCPSP. KU Leuven, September 2016. Note that this work has also been submitted for publication.. BibTeX

    @techreport{Davari2016a,
    	author = "Davari, Morteza and Demeulemeester, Erik",
    	title = "A novel branch-and-bound algorithm for the chance-constrained RCPSP",
    	institution = "KU Leuven",
    	year = 2016,
    	month = "September",
    	pdf = "?",
    	note = {Note that this work has also been submitted for publication.}
    }
    
  2. 2- Morteza Davari and Erik Demeulemeester. The proactive and reactive resource-constrained project scheduling problem. KU Leuven, April 2016. Note that this work has also been submitted for publication.. PDF BibTeX

    @techreport{Davari2016b,
    	author = "Davari, Morteza and Demeulemeester, Erik",
    	title = "The proactive and reactive resource-constrained project scheduling problem",
    	institution = "KU Leuven",
    	year = 2016,
    	month = "April",
    	keywords = "RCPSP; Stochastic activity durations; Proactive and reactive scheduling; Markov decision process",
    	pdf = "http://md6712.com/images/Files/PDF/KBI_1613.pdf",
    	note = {Note that this work has also been submitted for publication.}
    }
    
  3. 3- Morteza Davari, Erik Demeulemeester, Roel Leus and Fabrice Talla Nobibon. Exact algorithms for single-machine scheduling with time windows and precedence constraints. KU Leuven, December 2013. Note that this work has also been published in Journal of Scheduling in 2015. We recommend the authors to download the Journal of Scheduling version. PDF BibTeX

    @techreport{Davari2013,
    	author = "Davari, Morteza and Demeulemeester, Erik and Leus, Roel and Talla Nobibon, Fabrice",
    	title = "Exact algorithms for single-machine scheduling with time windows and precedence constraints",
    	institution = "KU Leuven",
    	year = 2013,
    	month = "Dec",
    	keywords = "single-machine scheduling, branch and bound, mixed-integer programming",
    	pdf = "https://lirias.kuleuven.be/bitstream/123456789/427727/1/KBI_1321.pdf",
    	timestamp = "2014.02.13",
    	note = {Note that this work has also been published in Journal of Scheduling in 2015. We recommend the authors to download the Journal of Scheduling version}
    }