Výsledky vyhledávání - "binary-integer programming model"

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

    Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system Autor Su, Ling-Huey

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydáno: Kidlington Elsevier Ltd 01.02.2009
    Vydáno v Computers & operations research (01.02.2009)
    “… A streamlined binary integer programming model is developed to solve the P ∥ C max / ∑ C i problem and the P ∥ ( E + T ) / ∑ C i problem…”
    Získat plný text
    Journal Article
  2. 2

    Optimizing urban rail timetable under time-dependent demand and oversaturated conditions Autor Niu, Huimin, Zhou, Xuesong

    ISSN: 0968-090X, 1879-2359
    Vydáno: Kidlington Elsevier India Pvt Ltd 01.11.2013
    “… A binary integer programming model incorporated with passenger loading and departure events is constructed to provide a theoretic description for the problem…”
    Získat plný text
    Journal Article
  3. 3

    Minimizing makespan subject to minimum total absolute deviation of completion time on identical parallel machines Autor Su, Ling-Huey, Chou, Fuh-Der, Chen, James C.

    ISSN: 0305-215X, 1029-0273
    Vydáno: Abingdon Taylor & Francis 01.10.2012
    Vydáno v Engineering optimization (01.10.2012)
    “…). An optimization algorithm is first proposed to solve TADC on an identical parallel machine and an iterative procedure based on a polynomial binary integer programming model is then proposed to minimize makespan…”
    Získat plný text
    Journal Article
  4. 4

    Noise-safe job rotation in multi-workday scheduling considering skill and demand requirements Autor Rerkjirattikal, Pavinee, Olapiriyakul, Sun

    ISSN: 2168-1015, 2168-1023
    Vydáno: Abingdon Taylor & Francis 17.11.2021
    “… The proposed model is formulated as a binary integer programming model with labor cost minimization…”
    Získat plný text
    Journal Article
  5. 5

    Location-coverage models for preventing attacks on interurban transportation networks Autor Auad, Ramon, Batta, Rajan

    ISSN: 0254-5330, 1572-9338
    Vydáno: New York Springer US 01.11.2017
    Vydáno v Annals of operations research (01.11.2017)
    “… In an attempt to solve this problem, a binary integer programming model is developed, whose objective is to maximize the expected vehicle coverage across the network…”
    Získat plný text
    Journal Article
  6. 6

    Optimization models for the tool change scheduling problem Autor Chen, Jen-Shiang

    ISSN: 0305-0483, 1873-5274
    Vydáno: Exeter Elsevier Ltd 01.10.2008
    Vydáno v Omega (Oxford) (01.10.2008)
    “… In this paper, we examine this problem to minimize the total tardiness of jobs. Two mixed binary integer programming models are developed to optimally solve this problem…”
    Získat plný text
    Journal Article
  7. 7

    Minimizing maximum tardiness in single FMS machine scheduling with tool changes Autor Lin, Kai-Yung, Chung, Yu-Ko

    ISSN: 0252-2667, 2169-0103
    Vydáno: Delhi Taylor & Francis Group 01.11.2009
    “… Two mixed binary integer programming models were developed to solve this problem optimally…”
    Získat plný text
    Journal Article