Coordination of inbound and outbound transportation schedules with the production schedule

Simple item page
dc.citation.epage192en_US
dc.citation.spage178en_US
dc.citation.volumeNumber103en_US
dc.contributor.authorKoƧ, U.en_US
dc.contributor.authorToptal, A.en_US
dc.contributor.authorSabuncuoglu, I.en_US
dc.date.accessioned2018-04-12T11:12:58Z
dc.date.available2018-04-12T11:12:58Z
dc.date.issued2017en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractThis paper studies the coordination of production and shipment schedules for a single stage in the supply chain. The production scheduling problem at the facility is modeled as belonging to a single process. Jobs that are located at a distant origin are carried to this facility making use of a finite number of capacitated vehicles. These vehicles, which are initially stationed close to the origin, are also used for the return of the jobs upon completion of their processing. In the paper, a model is developed to find the schedules of the facility and the vehicles jointly, allowing for effective utilization of the vehicles both in the inbound and the outbound. The objective of the proposed model is to minimize the sum of transportation costs and inventory holding costs. Issues related to transportation such as travel times, vehicle capacities, and waiting limits are explicitly accounted for. Inventories of the unprocessed and processed jobs at the facility are penalized. The paper contributes to the literature on supply chain scheduling under transportation considerations by modeling a practically motivated problem, proving that it is strongly NP-Hard, and developing an analytical and a numerical investigation for its solution. In particular, properties of the solution space are explored, lower bounds are developed on the optimal costs of the general and the special cases, and a computationally-efficient heuristic is proposed for solving large-size instances. The qualities of the heuristic and the lower bounds are demonstrated over an extensive numerical analysis.en_US
dc.description.provenanceMade available in DSpace on 2018-04-12T11:12:58Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 179475 bytes, checksum: ea0bedeb05ac9ccfb983c327e155f0c2 (MD5) Previous issue date: 2017en
dc.embargo.release2020-01-01en_US
dc.identifier.doi10.1016/j.cie.2016.11.020en_US
dc.identifier.issn0360-8352
dc.identifier.urihttp://hdl.handle.net/11693/37421
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cie.2016.11.020en_US
dc.source.titleComputers & Industrial Engineeringen_US
dc.subjectSupply chain schedulingen_US
dc.subjectTransportation schedulingen_US
dc.subjectCoordinated schedulesen_US
dc.subjectBeam searchen_US
dc.titleCoordination of inbound and outbound transportation schedules with the production scheduleen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Coordination_of_inbound_and_outbound_transportation_schedules_with_the_production_schedule.pdf
Size:
1.11 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering