Show simple item record

dc.contributor.authorToptal, A.en_US
dc.contributor.authorKoc, U.en_US
dc.contributor.authorSabuncuoglu, I.en_US
dc.date.accessioned2016-02-08T10:58:44Z
dc.date.available2016-02-08T10:58:44Z
dc.date.issued2014en_US
dc.identifier.issn0160-5682
dc.identifier.urihttp://hdl.handle.net/11693/26355
dc.description.abstractWe consider a manufacturer's planning problem to schedule order production and transportation to respective destinations. The manufacturer in this setting can use two vehicle types for outbound shipments. The first type is available in unlimited numbers. The availability of the second type, which is less expensive, changes over time. Motivated by some industry practices, we present formulations for three different solution approaches: the myopic solution, the hierarchical solution and the coordinated solution. These approaches vary in how the underlying production and transportation subproblems are solved, that is, sequentially versus jointly or heuristically versus optimally. We provide intractability proofs or polynomial-time exact solution procedures for the sub-problems and their special cases. We also compare the three solution approaches over a numerical study to quantify the savings from integration and explicit consideration of transportation availabilities. Our analytical and numerical results set a foundation and a need for a heuristic to solve the integrated problem. We thus propose a tabu search heuristic, which quickly generates near-optimal solutions.en_US
dc.language.isoEnglishen_US
dc.source.titleJournal of the Operational Research Societyen_US
dc.relation.isversionofhttps://doi.org/10.1057/jors.2012.184en_US
dc.subjectCargo capacityen_US
dc.subjectHeterogeneous vehiclesen_US
dc.subjectIndustry practicesen_US
dc.subjectIntegrated solutionsen_US
dc.subjectNear-optimal solutionsen_US
dc.subjectProduction and transportationsen_US
dc.subjectTabu Search heuristicen_US
dc.subjectTransportation planningen_US
dc.subjectAutomobile manufactureen_US
dc.subjectAvailabilityen_US
dc.subjectHeuristic algorithmsen_US
dc.subjectIntegrationen_US
dc.subjectPolynomialsen_US
dc.subjectSupply chain managementen_US
dc.subjectTabu searchen_US
dc.subjectProblem solvingen_US
dc.titleA joint production and transportation planning problem with heterogeneous vehiclesen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage180en_US
dc.citation.epage196en_US
dc.citation.volumeNumber65en_US
dc.citation.issueNumber2en_US
dc.identifier.doi10.1057/jors.2012.184en_US
dc.identifier.eissn1476-9360


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record