Order acceptance and scheduling with batch delivery

Jiang, Dakui; Tan, Jiayin

doi:10.1016/j.cie.2017.02.021

Cited by 15 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For most production enterprises, order scheduling means production scheduling, this paper is oriented to distribution enterprises, and only considers the order process in distribution center, that is order batching, batching sequence and route planning. Jiang et al [ 10 ] studied the order acceptance and scheduling problem whit batch delivery, and developed two approximate algorithms to solve this NP-Hard problem.…”

Section: Literature Reviewmentioning

confidence: 99%

An integrated distribution scheduling and route planning of food cold chain with demand surge

Chen

Lan

Wang

et al. 2022

Complex Intell. Syst.

View full text Add to dashboard Cite

With the rapid development of e-commerce, customers could order online to ensure timeliness. Therefore, e-commerce enterprises need to pick and distribute customers’ orders. These two operations are interdependent. Order picking needs to consider the vehicle route planning. At the same time, the vehicle route planning is also based on the batching of orders. Considering the demand surge scenario of food cold chain, with the shortest time and lowest cost to complete all distribution tasks as the objective, this paper aims at the integrated optimization of distribution scheduling and route planning, and establishes a mixed integer programming mathematical model. Finally, we design a three-stage heuristic algorithm to solve this problem, and use the actual data to carry out numerical experiments to verify the reliability and effectiveness of the mathematical model and heuristic algorithm.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

An integrated distribution scheduling and route planning of food cold chain with demand surge

Chen

Lan

Wang

et al. 2022

Complex Intell. Syst.

View full text Add to dashboard Cite

show abstract

“…In Wang et al (2015), the authors solve a scheduling problem with two parallel machines with two heuristics and an exact algorithm, using some properties of optimal solutions to maximize the total profit. In another environment with parallel machines, Jiang et al (2017) study the OAS problem with batch delivery in a supply chain consisting of a manufacturer and a customer. The objective is to minimize the weighted sum of the maximum lead times of accepted jobs and the total delivery cost.…”

Section: Multiple Machinesmentioning

confidence: 99%

“…In another environment with parallel machines, Jiang et al. ( 2017 ) study the OAS problem with batch delivery in a supply chain consisting of a manufacturer and a customer. The objective is to minimize the weighted sum of the maximum lead times of accepted jobs and the total delivery cost.…”

Section: Literature Reviewmentioning

confidence: 99%

Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times

Krim

Zufferey

Potvin

et al. 2021

J Sched

View full text Add to dashboard Cite

We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics.

show abstract

“…A recent extension of the basic order acceptance scheduling model considered in addresses an objective function that is the (weighted) sum of the maximum lead time (i.e., the time spent by an accepted order till it is delivered to the customer), the total delivery cost, and the total penalty of the rejected orders. The orders are delivered in batches with no more than b orders in a batch.…”

Section: Problem Formulationmentioning

confidence: 99%

Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow

Mosheiov

Strusevich

2017

Naval Research Logistics

View full text Add to dashboard Cite

In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min‐cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017

show abstract

Order acceptance and scheduling with batch delivery

Cited by 15 publications

References 11 publications

An integrated distribution scheduling and route planning of food cold chain with demand surge

An integrated distribution scheduling and route planning of food cold chain with demand surge

Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times

Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow

Contact Info

Product

Resources

About