Výsledky vyhledávání - Customer order scheduling Linear programming relaxation Approximation algorithm

  • Zobrazuji výsledky 1 - 2 z 2
Upřesnit hledání
  1. 1

    Customer order scheduling to minimize total weighted completion time Autor Wang, Guoqing, Cheng, T.C. Edwin

    ISSN: 0305-0483, 1873-5274
    Vydáno: Exeter Elsevier Ltd 01.10.2007
    Vydáno v Omega (Oxford) (01.10.2007)
    “…In this paper we study the scheduling problem in which each customer order consists of several jobs of different types, which are to be processed on m facilities…”
    Získat plný text
    Journal Article
  2. 2

    MIP-based heuristics for solving robust gate assignment problems Autor Yu, Chuhang, Zhang, Dong, Lau, H.Y.K.

    ISSN: 0360-8352, 1879-0550
    Vydáno: New York Elsevier Ltd 01.03.2016
    Vydáno v Computers & industrial engineering (01.03.2016)
    “…•We transit the quadratic objective function to an equivalent linear one.•The first one to adapt general MIP solving methods to solve GAP…”
    Získat plný text
    Journal Article