The coordinated production and transportation scheduling problem with a time-sensitive product: a branch-and-cut algorithm

Karaoğlan, İsmail; Kesen, Saadettin Erhan

doi:10.1080/00207543.2016.1213916

Cited by 64 publications

(25 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Commercial optimization software is capable to find optimal solutions for instances with up to 7 customers, except Park & Hong (2009) who are solving instances with up to 21 customers. Furthermore, in a simple single machine environment with batching, Karaoglan & Kesen (2017) solve instances with up to 50 customers using a branch and cut algorithm.…”

Section: Solution Methods: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Integrating production scheduling and vehicle routing decisions at the operational decision level: A review and discussion

Moons

Ramaekers

Caris

et al. 2017

Computers & Industrial Engineering

155

View full text Add to dashboard Cite

Production scheduling and vehicle routing are two well-studied problems in literature. Although these supply chain functions are interrelated, they are often solved sequentially. This uncoordinated approach can lead to suboptimal solutions. In the current competitive business environment, companies are searching for methods to save costs and improve their service level. Integrating production and distribution scheduling operations can be an approach to improve the overall performance. This paper focuses on integrated production-distribution operational level scheduling problems, which explicitly take into account vehicle routing decisions of the delivery process. Existing literature on integrated production scheduling and vehicle routing problems is reviewed and classified. Both the problem characteristics of mathematical models and the accompanying solution approaches are discussed to identify directions for further research.

show abstract

Section: Solution Methods: Discussionmentioning

confidence: 99%

“…The objective is to minimize the makespan, i.e., the time required to manufacture and deliver goods to satisfy all demand. Karaoglan & Kesen (2017) propose a mixed integer programming (MIP) model for the same problem as Geismar et al (2008). Devapriya et al (in press) extend the problem of Geismar et al (2008).…”

Section: Batch Processingmentioning

confidence: 99%

Integrating production scheduling and vehicle routing decisions at the operational decision level: A review and discussion

Moons

Ramaekers

Caris

et al. 2017

Computers & Industrial Engineering

155

View full text Add to dashboard Cite

show abstract

“…Khalifehzadeh et al [11] studied a multiobjective production-distribution system and the objectives are to minimize total costs and maximize the reliability of transportations system. Karaoglan et al [12] studied a variant of the problem, in which single product with limited shelf life is produced at single facility and the goal is to determine the minimum time required to produce and deliver all customer demands. Wei et al [13] considered a two-stage production process, where, in the first stage, raw materials are transformed into continuous resources that feed the discrete production of end products in the second stage, and production and distribution decisions are considered simultaneously.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The first step of the Lagrange approach is to determine which constraints should be relaxed. The big-M constraints such as constraints (6), (12), and (13) are not considered because the default CPLEX solver performs bad when solving models of similar structure. In this paper, we considered two candidate constraints, i.e., constraints (2) and (7), to be relaxed.…”

Section: Lagrange Relaxation Approachmentioning

confidence: 99%

Integrated Production and Distribution Planning for the Iron Ore Concentrate

Liu

Sun

2019

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper studies the production and distribution planning problem faced by the iron ore mining companies, which aims to minimize the total costs for the whole production and distribution system of the iron ore concentrate. The ores are first mined from multiple ore locations, and then sent to the corresponding dressing plant to produce ore concentrate, which will be sent to distribution centers and finally fulfill the customers' demands. This paper also tackles the difficulty of variable cut-off grade when making mining production planning decisions. A mixed-integer programming model is developed and then solved by a Lagrange relaxation (LR) procedure. Computational results indicate that the proposed solution method is more efficient than the standard solution software CPLEX.

show abstract

“…In the literature, a tremendous amount of research considers the production and transportation subproblems successively, and in the vast majority of companies, the scheduling problem is compounds that must be delivered within a certain time limit once produced. In the survey of Moons (2017) on integrated production scheduling and vehicle routing problems, two studies with one perishable product and one production facility are mentionned (Karaoğlan et al, 2017;Devapriya et al, 2017). Armstrong et al (2008) study the production and transportation problem with a single vehicle and a single production facility.…”

Section: Introduction To Integrated Problemsmentioning

confidence: 99%

Supply chain optimisation with both production and transportation integration: multiple vehicles for a single perishable product

Lacomme

Moukrim

Quilliot

et al. 2018

International Journal of Production Research

View full text Add to dashboard Cite

This paper deals with an extension of the integrated production and transportation scheduling problem (PTSP) by considering multiple vehicles (PTSPm) for optimisation of supply chains. The problem reflects a real concern for industry since production and transportation subproblems are commonly addressed independently or sequentially, which leads to sub-optimal solutions. The problem includes specific capacity constraints, the short lifespan of products and the special case of the single vehicle that has already been studied in the literature. A greedy randomised adaptive search procedure (GRASP) with an evolutionary local search (ELS) is proposed to solve the instances with a single vehicle as a special case. The method has been proven to be more effective than those published and provides shorter computational times with new best solutions for the single vehicle case. A new set of instances with multiple vehicles is introduced to favour equitable future research. Our study extends previous research using an indirect resolution approach and provides an algorithm to solve a wide range of one-machine scheduling problems with the proper coordination of single or multiple vehicles.

show abstract

The coordinated production and transportation scheduling problem with a time-sensitive product: a branch-and-cut algorithm

Cited by 64 publications

References 57 publications

Integrating production scheduling and vehicle routing decisions at the operational decision level: A review and discussion

Integrating production scheduling and vehicle routing decisions at the operational decision level: A review and discussion

Integrated Production and Distribution Planning for the Iron Ore Concentrate

Supply chain optimisation with both production and transportation integration: multiple vehicles for a single perishable product

Contact Info

Product

Resources

About