Abstract

When a company uses a make-to-order or direct-order business model, it needs to keep a low finished goods inventory level to be competitive. However, a low inventory level will cause the company to have little buffer to face the unforeseeable demand surge, which strengthens the close relationship between the stage of production and distribution. This paper probes an integrated production and distribution scheduling problem in which jobs are first produced by a set of unrelated parallel machines and then directly distributed to the corresponding customers by vehicles with limited capacity, with no inventory kept at the production stage. The objective is to find a joint production and distribution schedule such that the total cost, considering both customer service level and total distribution cost, is minimized. This paper integrated the earliest available machine first (EAMF) and variable neighborhood search (VNS) to solve the two-stage scheduling problem and used EAMF, which considers the load of the unrelated parallel machine to generate a set of production schedules to be systematically optimized by VNS, along with optimized routing, and applied a shaking mechanism of VNS to escape from the local optimal solution. The results of the computational experiments showed that the proposed method is better than ant colony optimization (ACO) heuristic methods in the computation time and solution quality.

References

1.
Hariri
,
A. M. A.
and
Potts
,
C. N.
, “
Heuristics for Scheduling Unrelated Parallel Machines
,”
Comput. Oper. Res.
, Vol.
18
, No.
3
,
1991
, pp.
323
331
. https://doi.org/10.1016/0305-0548(91)90034-O
2.
Bank
,
J.
and
Werner
,
F.
, “
Heuristic Algorithms for Unrelated Parallel Machine Scheduling With a Common Due Date, Release Dates, and Linear Earliness and Tardiness Penalties
,”
Math. Comput. Model.
, Vol.
33
, Nos.
4–5
,
2001
, pp.
363
383
. https://doi.org/10.1016/S0895-7177(00)00250-8
3.
Liaw
,
C. F.
,
Lin
,
Y. K.
,
Cheng
,
C. Y.
, and
Chen
,
M.
, “
Scheduling Unrelated Parallel Machines to Minimize Total Weighted Tardiness
,”
Comput. Oper. Res.
, Vol.
30
, No.
12
,
2003
, pp.
1777
1789
. https://doi.org/10.1016/S0305-0548(02)00105-3
4.
Glass
,
C. A.
,
Potts
,
C. N.
, and
Shade
,
P.
, “
Unrelated Parallel Machine Scheduling Using Local Search
,”
Math. Comput. Model.
, Vol.
20
, No.
2
,
1994
, pp.
41
52
. https://doi.org/10.1016/0895-7177(94)90205-4
5.
Kim
,
D. W.
,
Kim
,
K. H.
,
Jang
,
W.
, and
Chen
,
F. F.
, “
Unrelated Parallel Machine Scheduling With Setup Times Using Simulated Annealing
,”
Robot. Comput.-Integr. Manuf.
, Vol.
18
, Nos.
3–4
,
2002
, pp.
223
231
. https://doi.org/10.1016/S0736-5845(02)00013-3
6.
Kim
,
C. O.
and
Shin
,
H. J.
, “
Scheduling Jobs on Parallel Machines: A Restricted Tabu Search Approach
,”
Int. J. Adv. Manuf. Technol.
, Vol.
22
, Nos.
3–4
,
2003
, pp.
278
287
. https://doi.org/10.1007/s00170-002-1472-2
7.
Chen
,
C. L.
and
Chen
,
C. L.
, “
Hybrid Metaheuristics for Unrelated Parallel Machine Scheduling With Sequence-Dependent Setup Times
,”
Int. J. Adv. Manuf. Technol.
, Vol.
43
, Nos.
1–2
,
2009
, pp.
161
169
. https://doi.org/10.1007/s00170-008-1692-1
8.
Bilyk
,
A.
and
Monch
,
L.
, “
A Variable Neighborhood Search Approach for Planning and Scheduling of Jobs on Unrelated Parallel Machines
,”
J. Intell. Manuf.
, Vol.
23
, No.
5
,
2012
, pp.
1621
1635
. https://doi.org/10.1007/s10845-010-0464-6
9.
Dantzig
,
G. B.
and
Ramser
,
J. H.
, “
The Truck Dispatching Problem
,”
Manage. Sci.
, Vol.
6
, No.
1
,
1959
, pp.
80
91
. https://doi.org/10.1287/mnsc.6.1.80
10.
Irnich
,
S.
, “
A Multi-Depot Pickup and Delivery Problem With a Single Hub and Heterogeneous Vehicles
,”
Eur. J. Oper. Res.
, Vol.
122
, No.
2
,
2000
, pp.
310
328
. https://doi.org/10.1016/S0377-2217(99)00235-0
11.
Tavakkoli-Moghaddam
,
R.
,
Safaei
,
N.
,
Kah
,
M. M. O.
, and
Rabbani
,
M.
, “
A New Capacitated Vehicle Routing Problem With Split Service for Minimizing Fleet Cost by Simulated Annealing
,”
J. Frankl. Inst. Eng. Appl. Math.
, Vol.
344
, No.
5
,
2007
, pp.
406
425
. https://doi.org/10.1016/j.jfranklin.2005.12.002
12.
Braysy
,
O.
,
Porkka
,
P. P.
,
Dullaert
,
W.
,
Repoussis
,
P. P.
, and
Tarantilis
,
C. D.
, “
A Well-Scalable Metaheuristic for the Fleet Size and Mix Vehicle Routing Problem With Time Windows
,”
Exp. Syst. Appl.
, Vol.
36
, No.
4
,
2009
, pp.
8460
8475
. https://doi.org/10.1016/j.eswa.2008.10.040
13.
Garey
,
M. R.
and
Johnson
,
D. S.
,
Computers and Intractability: A Guide to the Theory of NP-Completeness
,
Freeman
,
San Francisco, CA
,
1979
.
14.
Liu
,
S. C.
and
Lee
,
W. T.
, “
A Heuristic Method for the Inventory Routing Problem With Time Windows
,”
Exp. Syst. Appl.
, Vol.
38
, No.
10
,
2011
, pp.
13223
13231
. https://doi.org/10.1016/j.eswa.2011.04.138
15.
Chen
,
Z. L.
, “
Integrated Production and Outbound Distribution Scheduling: Review and Extensions
,”
Oper. Res.
, Vol.
58
, No.
1
,
2010
, pp.
130
148
. https://doi.org/10.1287/opre.1080.0688
16.
Chang
,
Y. C.
,
Li
,
V. C.
, and
Chiang
,
C. J.
, “
An Ant Colony Optimization Heuristic for an Integrated Production and Distribution Scheduling Problem
,”
Eng. Optimiz.
, Vol.
46
, No.
4
,
2014
, pp.
503
520
. https://doi.org/10.1080/0305215X.2013.786062
17.
Mladenovic
,
N.
and
Hansen
,
P.
, “
Variable Neighborhood Search
,”
Comput. Oper. Res.
, Vol.
24
, No.
11
,
1997
, pp.
1097
1100
. https://doi.org/10.1016/S0305-0548(97)00031-2
18.
Hansen
,
P.
and
Mladenovic
,
N.
, “
Variable Neighborhood Search for the P-Median
,”
Location Sci.
, Vol.
5
, No.
4
,
1997
, pp.
207
226
. https://doi.org/10.1016/S0966-8349(98)00030-8
19.
Brimberg
,
J.
,
Hansen
,
P.
,
Mladenovic
,
N.
, and
Taillard
,
E. D.
, “
Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem
,”
Oper. Res.
, Vol.
48
, No.
3
,
2000
, pp.
444
460
.
20.
Hansen
,
P.
and
Mladenovic
,
N.
, “
J-Means: A New Local Search Heuristic for Minimum Sum of Squares Clustering
,”
Pattern Recognit.
, Vol.
34
, No.
2
,
2001
, pp.
405
413
. https://doi.org/10.1016/S0031-3203(99)00216-2
21.
Avanthay
,
C.
,
Hertz
,
A.
, and
Zufferey
,
N.
, “
A Variable Neighborhood Search for Graph Coloring
,”
Eur. J. Oper. Res.
, Vol.
151
, No.
2
,
2003
, pp.
379
388
. https://doi.org/10.1016/S0377-2217(02)00832-9
22.
Hansen
,
P.
and
Mladenovic
,
N.
, “
Variable Neighborhood Search
,”
Handbook of Metaheuristics
,
Glover
F.
and
Kochenberger
G. A.
, Eds.,
Kluwer Academic Publishers
,
Boston, MA
,
2003
, pp.
145
184
.
This content is only available via PDF.
You do not currently have access to this content.