Essec\Faculty\Model\Contribution {#6196
  #_index: "academ_contributions"
  #_id: "12123"
  #_source: array:25 [
    "id" => "12123"
    "slug" => "the-trip-scheduling-problem"
    "yearMonth" => "2009-11"
    "year" => "2009"
    "title" => "The Trip Scheduling Problem"
    "description" => "ARCHETTI, C. et SAVELSBERGH, M.W.P. (2009). The Trip Scheduling Problem. <i>Transportation Science</i>, 43(4), pp. 417-431."
    "authors" => array:2 [
      0 => array:3 [
        "name" => "ARCHETTI Claudia"
        "bid" => "B00773540"
        "slug" => "archetti-claudia"
      ]
      1 => array:1 [
        "name" => "SAVELSBERGH Martin W. P."
      ]
    ]
    "ouvrage" => ""
    "keywords" => array:5 [
      0 => "truckload transportation"
      1 => "driver"
      2 => "scheduling"
      3 => "hours of service"
      4 => "dispatch windows"
    ]
    "updatedAt" => "2021-07-13 14:32:00"
    "publicationUrl" => "https://www.jstor.org/stable/25769466"
    "publicationInfo" => array:3 [
      "pages" => "417-431"
      "volume" => "43"
      "number" => "4"
    ]
    "type" => array:2 [
      "fr" => "Articles"
      "en" => "Journal articles"
    ]
    "support_type" => array:2 [
      "fr" => "Revue scientifique"
      "en" => "Scientific journal"
    ]
    "countries" => array:2 [
      "fr" => null
      "en" => null
    ]
    "abstract" => array:2 [
      "fr" => "The hours of service (HOS) regulations of the department of transportation severely restrict the set of feasible driver schedules. So much so that establishing whether a sequence of full truckload transportation requests, each with a dispatch window at the origin, can feasibly be executed by a driver is no longer a matter of simple forward simulation. We consider this problem and prove that the feasibility of a driver schedule can be checked in polynomial time by providing an O(n³) algorithm for establishing whether a sequence of full truckload transportation requests, each with a dispatch window at the origin, can be executed by a driver."
      "en" => "The hours of service (HOS) regulations of the department of transportation severely restrict the set of feasible driver schedules. So much so that establishing whether a sequence of full truckload transportation requests, each with a dispatch window at the origin, can feasibly be executed by a driver is no longer a matter of simple forward simulation. We consider this problem and prove that the feasibility of a driver schedule can be checked in polynomial time by providing an O(n³) algorithm for establishing whether a sequence of full truckload transportation requests, each with a dispatch window at the origin, can be executed by a driver."
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
      "en" => "Information Systems, Decision Sciences and Statistics"
    ]
    "indexedAt" => "2023-12-09T12:22:10.000Z"
    "docTitle" => "The Trip Scheduling Problem"
    "docSurtitle" => "Articles"
    "authorNames" => "<a href="/cv/archetti-claudia">ARCHETTI Claudia</a>, SAVELSBERGH Martin W. P."
    "docDescription" => "<span class="document-property-authors">ARCHETTI Claudia, SAVELSBERGH Martin W. P.</span><br><span class="document-property-authors_fields">Systèmes d’Information, Sciences de la Décision et Statistiques</span> | <span class="document-property-year">2009</span>"
    "keywordList" => "<a href="#">truckload transportation</a>, <a href="#">driver</a>, <a href="#">scheduling</a>, <a href="#">hours of service</a>, <a href="#">dispatch windows</a>"
    "docPreview" => "<b>The Trip Scheduling Problem</b><br><span>2009-11 | Articles </span>"
    "docType" => "research"
  ]
  +lang: "fr"
  +"_type": "_doc"
  +"_score": 8.966228
  +"parent": null
}