首页 > 图书详情

供应链协同优化管理 经济管理类;专著;企业管理;企业管理 VIP

售价:¥60.52 ¥89
0人在读 |
0 评分
刘玲 刘森   社会科学文献出版社  2019-05 出版
ISBN:978-7-5201-4657-9

*温馨提示:此类商品为数字类产品,不支持退换货,不支持下载打印

图书简介 目录 参考文献 音频 视频
本书从运作层面出发,针对面向订单制造企业以及其他时间敏感性较强的行业,从整体优化的角度去研究企业生产与运输协同调度问题,同时决策订单生产排序与车辆运输路径,从而在有限的资源下实现较高的客户服务水平。书中探索生产排序与车辆运输路径的内在联系,建立数学模型,根据问题约束的不同设计相应的启发式算法,并根据问题特性探讨问题的上下界解。
[展开]
  • 文前辅文
  • 前言
  • 第1章 绪论
    1. 1.1 研究背景
    2. 1.2 研究问题
    3. 1.3 研究意义
    4. 1.4 研究方法
    5. 1.5 研究内容
  • 第2章 理论基础
    1. 2.1 引言
    2. 2.2 生产调度问题
    3. 2.3 车辆路径问题
    4. 2.4 生产与运输协同调度问题
  • 第3章 研究综述
    1. 3.1 引言
    2. 3.2 生产调度问题综述
    3. 3.3 车辆路径问题综述
    4. 3.4 直达运输模式下生产与车辆运输协同调度问题
    5. 3.5 运输路径优化模式下生产与车辆运输协同调度问题
    6. 3.6 生产与车辆运输协同调度问题求解算法研究
    7. 3.7 本章小结
  • 第4章 给定订单生产完成时间的车辆路径问题
    1. 4.1 引言
    2. 4.2 问题描述与数学模型
    3. 4.3 禁忌搜索算法设计
    4. 4.4 两种下界计算方法
    5. 4.5 实验结果分析
    6. 4.6 本章小结
  • 第5章 最小化最晚订单交付时间的生产与运输协同调度问题
    1. 5.1 引言
    2. 5.2 问题描述与数学模型
    3. 5.3 最优解性质与订单分批算法
    4. 5.4 两种启发式算法
    5. 5.5 实验结果分析
    6. 5.6 本章小结
  • 第6章 最小化所有订单交付时间之和的生产与运输协同调度问题
    1. 6.1 引言
    2. 6.2 问题描述与数学模型
    3. 6.3 变邻域搜索算法
    4. 6.4 一种分解算法求下界
    5. 6.5 实验结果分析
    6. 6.6 本章小结
  • 第7章 总结与展望
    1. 7.1 全文总结
    2. 7.2 研究展望
  • 附录
[1][1]柏孟卓,陈峰,唐国春,2007,《供应链管理中生产和运输集成的排序问题》,《工业工程与管理》,12(5):547-50。 [2][2]柏孟卓,唐国春,2009,《与交货期有关的供应链排序问题》,《运筹学学报》,13(1):113-119。 [3][3]陈荣秋,马士华,1999,《生产与运作管理》,高等教育出版社。 [4][4]桂华明,马士华,2008,《运输成本对批量敏感时的供应链批量协调策略比较研究》,《中国管理科学》,16(2):49-56。 [5][5]宫华,唐立新,2011,《并行机生产与具有等待时间限制的成批运输协调调度问题》,《控制与决策》,26(6):921-924。 [6][6]宫华,张彪,许可,2015,《并行机生产与成批配送协调调度问题的近似策略》,《沈阳工业大学学报》,37(3):324-328。 [7][7]胡运权,郭耀煌,2012,《运筹学教程》,清华大学出版社。 [8][8]蒋大奎,2012,《按单生产直达运输模式下的生产运输集成调度问题研究》,天津大学博士学位论文。 [9][9]靳志宏,2008,《物流调度与协调》,中国物资出版社。 [10][10]李昆鹏,马士华,2007,《ATO供应链中航空运输及并行机生产协调调度问题》,《系统工程理论与实践》,27(12):7-15。 [11][11]李娜,王首彬,2011,《不确定需求下易腐产品的生产配送优化模型》,《计算机应用研究》,28(3):927-929。 [12][12]马雪丽,王淑云,刘晓冰等,2017,《易腐食品二级供应链生产调度与配送路线的协同优化》,《工业工程与管理》,22(2):46-52。 [13][13]唐国春,2006,《供应链排序的模型和方法》,中国运筹学会第八届学术交流会论文集,(中国)香港。 [14][14]孙鑫,陈秋双,龙磊,徐海涛,2006,《三层供应链联合调度算法研究》,《计算机集成制造系统》,12(4):590-595。 [15][15]王万良,吴启迪,2007,《生产调度智能算法及其应用》,科学出版社。 [16][16]汪定伟,王俊伟,王洪峰,张瑞友,郭哲,2007,《智能优化算法》,高等教育出版社。 [17][17]吴瑶,马祖军,2017,《时变路网下带时间窗的易腐食品生产—配送问题》,《系统工程理论与实践》,37(1):172-181。 [18][18]徐建有,2015,《基于智能优化算法的生产调度问题研究》,东北大学博士学位论文。 [19][19]叶秉如,2001,《水资源系统优化规划和调度》,中国水利水电出版社。 [20][20]周黍雨,2012,《制造与仓储管理中的若干排序问题的精确算法研究》,华东理工大学博士学位论文。 [21][21]Anderson D.,Lee H.,“Synchronized Supply Chains:The New Frontier,”Ascet6(1)(1999):56-59. [22][22]Armstrong R.,Gao S.,Lei L.,“A Zero-inventory Production and Distribution Problem with a Fixed Customer Sequence,”Annals of Operations Research159(1)(2008):395-414. [23][23]Armentano V.A.,Shiguemoto A.L.,Løkketangen A.,“Tabu Search with Path Relinking for an Integrated Production-Distribution Problem,”Computers & Operations Research38(8)(2011):1199-1209. [24][24]Abdeljaoued M.A.,Saadani N.E.H.,Bahroun Z.,“Heuristic and Aetaheuristic Approaches for Parallel Machine Scheduling Under Resource Constraints,”Operational Research (2018):1-24. [25][25]Avella P.,Boccia M.,Vasilyev I.,“Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows,”Computers & Operations Research40(8)(2013):2004-2010. [26][26]Adulyasak Y.,Cordeau J.F.,Jans R.,“Optimization-based Adaptive Large Neighborhood Search for the Production Routing Problem,”Transportation Science48(1)(2012):20-45. [27][27]Amorim P.,Günther H.O.,Almada-Lobo B.,“Multi-objective Integrated Production and Distribution Planning of Perishable Products,”International Journal of Production Economics138(1)(2012):89-101. [28][28]Archetti C.,Feillet D.,Speranza M.G.,“Complexity of Routing Problems with Release Dates,”European Journal of Operational Research247(3)(2015):797-803. [29][29]Averbakh I.,“On-line Integrated Production-distribution Scheduling Problems with Capacitated Deliveries,”European Journal of Operational Research200(2)(2010):377-384. [30][30]Averbakh I.,“Baysan M.Semi-online Two-level Supply Chain Scheduling Problems”,Journal of Scheduling15(3)(2012):381-390. [31][31]Asbach L.,Dorndorf U.,Pesch E.,“Analysis,Modeling and Solution of the Concrete Delivery Problem,”European Journal of Operational Research 193(3)(2009):820-835. [32][32]Agnetis A.,Aloulou M.A.,Fu L.L.,“Coordination of Production and Interstage Batch Delivery with Outsourced Distribution,”European Journal of Operational Research 238(1)(2014):130-142. [33][33]Agnetis A.,Aloulou M.A.,Fu L.L.,et al.,“Two Faster Algorithms for Coordination of Production and Batch Delivery:A Note,”European Journal of Operational Research241(3)(2015):927-930. [34][34]Agnetis A.,Aloulou M.A.,Kovalyov M.Y.,“Integrated Production Scheduling and Batch Delivery with Fixed Departure Times and Inventory Holding Costs,”International Journal of Production Research55(20)(2017):6193-6206. [35][35]Annouch A.,Bouyahyaoui K.,Bellabdaoui A.,A Literature Review on the Full Truckload Vehicle Routing Problems(International Conference On Logistics Operations Management.IEEE,2016),21-35. [36][36]Alvarenga G.B.,Mateus G.R.,De Tomi G.,“A Genetic and Set Partitioning Two-phase Approach for the Vehicle Routing Problem with Time Windows,”Computers & Operations Research34(6)(2007):1561-1584. [37][37]Anghinolfi D.,Paolucci M.,“A New Discrete Particle Swarm Optimization Approach for the Single-machine Total Weighted Tardiness Scheduling Problem with Sequence-dependent Setup Times,”European Journal of Operational Research 193(1)(2009):73-85. [38][38]Balseiro S.R.,Loiseau I.,Ramonet J.,“An Ant Colony Algorithm Hybridized with Insertion Heuristics for the Time Dependent Vehicle Routing Problem with Time Windows,”Computers& Operations Research38(6)(2011):954-966. [39][39]Bashiri M.,Badri H.,Talebi J.,“A New Approach to Tactical and Strategic Planning in Production-distribution Networks,”Applied Mathematical Modelling 36(4)(2012):1703-1717. [40][40]Belo-Filho M.A.F.,Amorim P.,Almada-Lobo B.,“An Adaptive Large Neighbourhood Search for the Operational Integrated Production and Distribution Problem of Perishable Products,”International Journal of Production Research 53(20)(2015):6040-6058. [41][41]Berhan E.,Beshah B.,Kitaw D.,“Stochastic Vehicle Routing Problem:A Literature Survey,”Journal of Information & Knowledge Management13(03)(2014):1-12. [42][42]Bard J.F.,Nananukul N.,“A Branch-and-price Algorithm for an Integrated Production and Inventory Routing Problem,”Computers & Operations Research 37(12)(2010):2202-2217. [43][43]Bai J.,Li Z.R.,Wang J.J.,“Single Machine Common Flow Allowance Scheduling with Deteriorating Jobs and a Rate-Modifying Activity,”Applied Mathematical Modelling 38(23)(2014):5431-5438. [44][44]Bilgen B.,Ozkarahan I.,“Strategic Tactical and Operational Production-distribution Models:A Review,”International Journal of Technology Management28(2)(2004):151-171. [45][45]Brandão J.,“A Tabu Search Algorithm for the Open Vehicle Routing Problem,”European Journal of Operational Research 157(3)(2004):552-564. [46][46]Boudia M.,Prins C.,“A Memetic Algorithm with Dynamic Population Management for an Integrated Production-Distribution Problem,”European Journal of Operational Research 195(3)(2009):703-715. [47][47]Balinski M.L.,Quandt R.E.,“On an Integer Program for a Delivery Problem,”Operations Research 12(2)(1964):300-304. [48][48]Chen B.,Potts C.N.,Woeginger G.J.,“A Review of Machine Scheduling:Complexity,Algorithms and Approximability,”Handbook of Combinatorial Optimization (New York:Springer,1998). [49][49]Chen L.,Ye D.S.,Zhang G.C.,“Parallel Machine Scheduling with Speed-up Resources,”European Journal of Operational Research268(1)(2018):108-112. [50][50]Christofides N.,Mingozzi A.,Toth P.,“Exact Algorithms for the Vehicle Routing Problem,Based on Spanning Tree and Shortest Path Relaxations,”Mathematical Programming20(1)(1981):255-282. [51][51]Chang Y.C.,Chang K.H.,Chang T.K.,“Applied Column Generation-based Approach to Solve Supply Chain Scheduling Problems,”International Journal of Production Research 51(13)(2013):4070-4086. [52][52]Chang Y.C.,Li V.C.,Chiang C.J.,“An Ant Colony Optimization Heuristic for an Integrated Production and Distribution Scheduling Problem,”Engineering Optimization 46(4)(2014):503-520. [53][53]Chen H.K.,Hsueh C.F.,Chang M.S.,“Production Scheduling and Vehicle Routing with Time Windows for Perishable Food Products,”Computers & Operations Research36(7)(2009):2311-2319. [54][54]Cheng B.,Cai J.,Yang S.et al.,“Algorithms for Scheduling Incompatible Job Families on Single Batching Machine with Limited Capacity,”Computers & Industrial Engineering75(1)(2014A):116-120. [55][55]Cheng T.,Liu C.,Lee W.,“Two-agent Single-machine Scheduling to Minimize the Weighted Sum of the Agents' Objective Functions,”Computers & Industrial Engineering78(2014B):66-73. [56][56]Condotta A.,Knust S.,Meier D.,“Tabu Search and Lower Bounds for a Combined Production-transportation Problem,”Computers & Operations Research40(3)(2013):886-900. [57][57]Chang Y.C.,Lee C.Y.,“Machine Scheduling with Job Delivery Coordination,”European Journal of Operational Research 158(2)(2004):470-487. [58][58]Cakici E.,Mason S.J.,Kurz M.E.,“Multi-objective Analysis of an Integrated Supply Chain Scheduling Problem,”International Journal of Production Research50(10)(2012):2624-2638. [59][59]Chu P.C.,Beasley J.E.,“A Genetic Algorithm for the Generalised Assignment Problem,”Computers & Operations Research24(1)(1997):17-23. [60][60]Campbell A.M.,Vandenbussche D.,Hermann W.,“Routing for Relief Efforts,”Transportation Science42(2)(2008):127-145. [61][61]Chen Z.L.,“Integrated Production and Outbound Distribution Scheduling:Review and Extensions,”Operations Research58(1)(2010):130-148. [62][62]Chen Z.L.,Vairaktarakis G.L.,“Integrated Scheduling of Production and Distribution Operations,”Management Science51(4)(2005):614-628. [63][63]Chen B.,Lee C.Y.,“Logistics Scheduling with Batching and Transportation,”European Journal of Operational Research 189(3)(2008):871-876. [64][64]Cheng T.,Gordon V.S.,Kovalyov M.Y.,“Single Machine Scheduling with Batch Deliveries,”European Journal of Operational Research 94(2)(1996):277-283. [65][65]Chen Z.L.,Pundoor G.,“Integrated Order Scheduling and Packing,”Production and Operations Management18(6)(2009):672-692. [66][66]Crauwels H.A.J.,Potts C.N.,Van Wassenhove L.N.,“Local Search Heuristics for Single-machine Scheduling with Batching to Minimize the Number of Late Jobs,”European Journal of Operational Research 90(2):(1996)200-213. [67][67]Chen B.,Potts C.N.,Woeginger G.J.,A Review of Machine Scheduling:Complexity,Algorithms and Approximability (New York:Springer,1998). [68][68]Clarke G.U.,Wright J.W.,“Scheduling of Vehicles from a Central Depot to a Number of Delivery Points,”Operations Research12(4)(1964):568-581. [69][69]Cordeau J.F.,Laporte G.,Mercier A.,“A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows,”Journal of the Operational Research Society 52(8)(2001):928-936. [70][70]Cordeau J.F.,Maischberger M.,“A Parallel Iterated Tabu Search Heuristic for Vehicle Routing Problems,”Computers & Operations Research39(9)(2012):2033-2050. [71][71]Devapriya P.,Ferrell W.,Geismar N.,“Integrated Production and Distribution Scheduling with a Perishable Product,”European Journal of Operational Research259(3)(2017):906-916. [72][72]De Jaegere N.,Defraeye M.,Van Nieuwenhuyse I.,“The Vehicle Routing Problem:State of the Art Classification and Review,”Computers& Industrial Engineering99(2016):300-313. [73][73]Dewi P.C.,Amelia S.,Vehicle Routing Problem(VRP)for Courier Service:A Review(Matec Web of Conferences,2018),pp.1-9. [74][74]Dhawan C.,Kumar Nassa V.,“Review on Vehicle Routing Problem Using Ant Colony Optimization,”International Journal of Advanced Research in Computer Science6(5)(2014):74-78. [75][75]Dabia S.,Ropke S.,Van Woensel T.,“Branch and Price for the Time-dependent Vehicle Routing Problem with Time Windows,”Transportation Science47(3)(2013):380-396. [76][76]Desrosiers J.,Dumas Y.,Solomon M.M.,“Chapter 2,Time Constrained Routing and Scheduling,”Handbooks in Operations Research and Management Science8(1995):35-139. [77][77]Dorigo M.,Birattari M.,Ant Colony Optimization (New York:Springer,2010). [78][78]Desrochers M.,Desrosiers J.,Solomon M.,“A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows,”Operations Research40(2)(1992):342-354. [79][79]Dawande M.,Geismar H.N.,Hall N.G.,Sriskandarajah C.,“Supply Chain Scheduling:Distribution Systems,”Production and Operations Management 15(2)(2006):243-261. [80][80]Desrochers M.,Lenstra J.K.,Savelsbergh M.W.,“A Classification Scheme for Vehicle Routing and Scheduling Problems,”European Journal of Operational Research46(3)(1990):322-332. [81][81]Eglese R.,Zambirinis S.,“Disruption Management in Vehicle Routing and Scheduling for Road Freight Transport:A Review,”Top26(1)(2018):1-17. [82][82]Eksioglu B.,Vural A.V.,Reisman A.,“Survey:The Vehicle Routing Problem:A Taxonomic Review,”Computers & Industrial Engineering57(4)(2009):1472-1483. [83][83]Erengüç S.S.,Simpson N.C.,Vakharia A.J.,“Integrated Production/Distribution Planning in Supply Chains:An Invited Review,”European Journal of Operational Research115(2)(1999):219-236. [84][84]Edis E.B.,Oguz C.,Ozkarahan I.,“Parallel Machine Scheduling with Additional Resources:Notation,Classification,Models and Solution Methods,”European Journal of Operational Research230(3)(2013):449-463. [85][85]Eilon S.,Watson-Gandy C.D.T.,Christofides N.,et al.,“Distribution Management-mathematical Modelling and Practical Analysis,”IEEE,Transactions On Systems Man & Cybernetics21(6)(1974):589-589. [86][86]Ehmke J.F.,Campbell A.M.,Urban T.L.,“Ensuring Service Levels in Routing Problems with Time Windows and Stochastic Travel Times,”European Journal of Operational Research240(2)(2015):539-550. [87][87]Fisher M.L.,“The Lagrangian Relaxation Method for Solving Integer Programming Problems,”Management Science50(12_Supplement)(2004):1861-1871. [88][88]Fisher M.L.,“An Applications Oriented Guide to Lagrangian Relaxation,”Interfaces15(2)(1985):10-21. [89][89]Fisher M.L.,Jaikumar R.,“A Generalized Assignment Heuristic for Vehicle Routing,”Networks 11(2)(1981):109-124. [90][90]Fisher M.L.,Jaikumar R.,A Decomposition Algorithm for Large-scale Vehicle Routing(Wharton School,University of Pennsylvania,1978). [91][91]Fu B.,Huo Y.,Zhao H.,“Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints,”Theoretical Computer Science422(2012):39-51. [92][92]Farahani P.,Grunow M.,Günther H.O.,“Integrated Production and Distribution Planning for Perishable Food Products,”Flexible Services and Manufacturing Journal24(1)(2012):28-51. [93][93]Fu L.L.,Aloulou M.A.,Triki C.,“Integrated Production Scheduling and Vehicle Routing Problem with Job Splitting and Delivery Time Windows,”International Journal of Production Research55(20)(2017):5942-5957. [94][94]Fleszar K.,Osman I.H.,Hindi K.S.,“A Variable Neighbourhood Search Algorithm for the Open Vehicle Routing Problem,”European Journal of Operational Research195(3)(2009):803-809. [95][95]Fleszar K.,Hindi K.S.,“Algorithms for the Unrelated Parallel Machine Scheduling Problem with Are Source Constraint,”European Journal of Operational Research271(3)(2018):839-848. [96][96]Fatih Tasgetiren M.,Liang Y.C.,Sevkli M.,“Particle Swarm Optimization and Differential Evolution for the Single Machine Total Weighted Tardiness Problem,”International Journal of Production Research44(22)(2006):4737-4754. [97][97]Fanjul-Peyro L.,Perea F.,Ruiz,Rubén.,“Models and Matheuristics for the Unrelated Parallel Machine Scheduling Problem with Additional Resources,”European Journal of Operational Research260(2)(2017):482-493. [98][98]Funke B.,Tore Grünert,Irnich S.,“Local Search for Vehicle Routing and Scheduling Problems:Review and Conceptual Integration,”Journal of Heuristics11(4)(2005):267-306. [99][99]Gupta A.,Saini S.,“On Solutions to Vehicle Routing Problems Using Swarm Optimization Techniques:A Review,”Advances in Computer and Computational Sciences553(2017):345-354. [100][100]Gendreau M.,Ghiani G.,Guerriero E .,“Time-dependent Routing Problems:A Review,”Computers & Operations Research 64(2015):189-197. [101][101]Goetschalckx M.,Vidal C.J.,Dogan K.,“Modeling and Design of Global Logistics Systems:A Review of Integrated Strategic and Tactical Models and Design Algorithms,”European Journal of Operational Research143(1)(2002):1-18. [102][102]Guo Z.,Shi L.,Chen L.,“A Harmony Search-based Memetic Optimization Model for Integrated Production and Transportation Scheduling in MTO Manufacturing,”Omega66(2017):327-343. [103][103]Garcia J.,Lozano S.,“Production and Vehicle Scheduling for Ready-mix Operations,”Computers & Industrial Engineering 46(4)(2004):803-816. [104][104]Garcia J.M.,Lozano S.,Canca D.,“Coordinated Scheduling of Production and Delivery from Multiple Plants,”Robotics and Computer-Integrated Manufacturing20(3)(2004):191-198. [105][105]Garcia J.M.,Lozano S.,“Production and Delivery Scheduling Problem with Time Windows,”Computers & Industrial Engineering48(4)(2005):733-742. [106][106]Geismar H.N.,Laporte G.,Lei L.,Sriskandarajah C.,“The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan,”Informs Journal on Computing20(1)(2008):21-33. [107][107]Gillett B.E.,Miller L.R.,“A Heuristic Algorithm for The Vehicle-dispatch Problem,”Operations Research 22(2)(1974):340-349. [108][108]Glover F.,“Heuristics for Integer Programming Using Surrogate Constraints,”Decision Sciences8(1)(1977):156-166. [109][109]Glover F.,“Future Paths for Integer Programming and Links to Artificial Intelligence,”Computers & Operations Research13(5)(1986):533-549. [110][110]Gong Y.J.,Zhang J.,Liu O.,“Optimizing the Vehicle Routing Problem with Time Windows:a Discrete Particle Swarm Optimization Approach,”IEEE,Transactions On Systems Man & CyberneticsPart C 42(2)(2012):254-267. [111][111]Guignard M.,Kim S.,“Lagrangean Decomposition:A Model Yielding Stronger Lagrangean Bounds,”Mathematical Programming39(2)(1987):215-228. [112][112]Graham R.L.,Lawler E.L.,Lenstra J.K.,“Optimization and Approximation in Deterministic Sequencing and Scheduling:A Survey,”Annals of Discrete Mathematics5(1)(1979):287-326. [113][113]Gabel T.,Riedmiller M .,“Distributed Policy Search Reinforcement Learning for Job-shop Scheduling Tasks,”International Journal of Production Research 50(1)(2012):41-61. [114][114]Gupta J.N.D.,“Two-stage,Hybrid Flowshop Scheduling Problem,”Journal of the Operational Research Society39(4)(1988):359-364. [115][115]Huo Y.,Leung J.Y.T.,Wang X.,“Integrated Production and Delivery Scheduling with Disjoint Windows,”Discrete Applied Mathematics158(8)(2010):921-931. [116][116]Hammond J.H.,Coordination as the Basis for Quick Response:A Case for Virtualintegration in Supply Networks(Graduate School of Business Administration,Harvard University,1992). [117][117]Hall N.G.,Potts C.N.,“Supply Chain Scheduling:Batching and Delivery,”Operations Research51(4)(2003):566-584. [118][118]Ho S.C.,Gendreau M.,“Path Relinking for the Vehicle Routing Problem,”Journal of Heuristics12(1)(2006):55-72. [119][119]Held M.,Wolfe P.,Crowder H P.,“Validation of Subgradient Optimization,”Mathematical Programming6(1)(1974):62-88. [120][120]Herrmann J.W.,Lee C.Y.,“On Scheduling to Minimize Earliness-tardiness and Batch Delivery Costs with a Common Due Date,”European Journal of Operational Research70(3)(1993):272-288. [121][121]Hemmelmayr V.C.,Doerner K.F.,Hartl R.F.,“A Variable Neighborhood Search Heuristic for Periodic Routing Problems,”European Journal of Operational Research195(3)(2009):791-802. [122][122]Hall N.G.,Potts C.N.,“The Coordination of Scheduling and Batch Deliveries,”Annals of Operations Research 135(1)(2005):41-64. [123][123]Hong S.C.,Park Y B.,“A Heuristic for Bi-objective Vehicle Routing with Time Window Constraints,”International Journal of Production Economics62(3)(1999):249-258. [124][124]Holland J.H.,Adaptation in Natural and Artificial Systems:An Introductory Analysis with Applications to Biology,Control and Artificial Intelligence(Detroit:University of Michigan Press,1975). [125][125]He J.,Li Q.,Xu D.,“Scheduling Two Parallel Machines with Machine-dependent Availabilities,”Computers & Operations Research72(1)(2016):31-42. [126][126]Herr O.,Goel A.,“Comparison of Two Integer Programming Formulations for a Single Machine Family Scheduling Problem to Minimize Total Tardiness,”Procedia Cirp19(2014):174-179. [127][127]Han B.,Zhang W.,Lu X.,“On-line Supply Chain Scheduling for Single-machine and Parallel-machine Configurations with a Single Customer:Minimizing the Makespan and Delivery Cost,”European Journal of Operational Research244(3)(2015):704-714. [128][128]Imai A.,Nishimura E.,Current J.,“A Lagrangian Relaxation-based Heuristic for the Vehicle Routing with Full Container Load,”European Journal of Operational Research176(1)(2007):87-105. [129][129]Ìsmail Karaolan,Kesen S.E.,“The Coordinated Production and Transportation Scheduling Problem with a Time-sensitive Product:A Branch-and-cut Algorithm,” International Journal of Production Research55(2)(2017):536-557. [130][130]Jha J.,Shanker K.,“A Coordinated Two-phase Approach for Operational Decisions with Vehicle Routing in a Single-vendor Multi-buyer System,”International Journal of Production Research 51(5)(2013):1426-1450. [131][131]Ji M.,He Y.,Cheng T.E.,“Batch Delivery Scheduling with Batch Delivery Cost on a Single Machine,”European Journal of Operational Research176(2)(2007):745-755. [132][132]Juan,“Simulation-optimization Methods in Vehicle Routing Problems:A Literature Review and an Example,”in Ángel A.,Faulin J.,Pérez Bernabeu,Elena,Modeling and Simulation in Engineering,Economics,and Management (Heidelberg:Springer,2013). [133][133]Kim G.,Ong Y.S.,Kim C.,“City Vehicle Routing Problem(City Vrp):a Review,”IEEE,Transactions on Intelligent Transportation Systems4(16)(2015):1654-1666. [134][134]Kytöjoki J.,Nuortio T.,Bräysy O.,Gendreau M.,“An Efficient Variable Neighborhood Search Heuristic for Very Large Scale Vehicle Routing Problems,”Computers & Operations Research34(9)(2007):2743-2757. [135][135]Kress D.,Meiswinkel S.,Pesch E.,“Mechanism Design for Machine Scheduling Problems:Classification and Literature Overview,”Or Spectrum40(3)(2018(A)):583-611. [136][136]Kress D.,Barketau M.,Pesch E.,“Single-machine Batch Scheduling to Minimize the Total Setup Cost in the Presence of Deadlines,”Journal of Scheduling2(2018(B)):1-12. [137][137]Kacem I.,Kellerer H.,“Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times under Non-availability or Deadline Constraints,”Algorithmica,2(2018):1-19. [138][138]Koulamas C.,“The Single-machine Total Tardiness Scheduling Problem:Review and Extensions,”European Journal of Operational Research202(1)(2010):1-7. [139][139]Koulamas C.,“A New Constructive Heuristic for the Flowshop Scheduling Problem,”European Journal of Operational Research105(1)(1998):66-71. [140][140]Ke L.,Feng Z.,“A Two-phase Metaheuristic for the Cumulative Capacitated Vehicle Routing Problem,”Computers & Operations Research40(2)(2013):633-638. [141][141]Kirkpatrick S.,Vecchi M.P.,“Optimization by Simmulated Annealing,”Science42(3)(1983):671-680. [142][142]Kilby P.,Prosser P.,Shaw P.,Guided Local Search for the Vehicle Routing Problem with Time Windows (New York:Springer,1999). [143][143]Kim E.S.,Oron D.,“Multi-location Production and Delivery with Job Selection,”Computers & Operations Research40(5)(2013):1461-1466. [144][144]Kopanos G.M.,Puigjaner L.,Georgiadis M.C.,“Simultaneous Production and Logistics Operations Planning in Semicontinuous Food Industries,”Omega40(5)(2012):634-650. [145][145]Koc U.,Toptal A.,Sabuncuoglu I.,“A Class of Joint Production and Transportation Planning Problems under Different Delivery Policies,”Operations Research Letters41(1)(2013):54-60. [146][146]Khowala K.,Fowler J.,Keha A.,“Single Machine Scheduling with Interfering Job Sets,”Computers & Operations Research45(2014):97-107. [147][147]Kirlik G.,Oguz C.,“A Variable Neighborhood Search for Minimizing Total Weighted Tardiness with Sequence Dependent Setup Times on a Single Machine,”Computers & Operations Research 39(7)(2012):1506-1520. [148][148]Kohl N.,Madsen O.B.G.,“An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation,”Operations Research45(3)(1997):395-406. [149][149]Li K.,Chen B.,Sivakumar A.I.,“An Inventory-routing Problem with the Objective of Travel Time Minimization,”European Journal of Operational Research236(3)(2014):936-945. [150][150]Li K.,et al.,“Integrated Production and Delivery with Single Machine and Multiple Vehicles,”Expert Systems with Applications57(3)(2016),12-20. [151][151]Lin Y.K.,“Scheduling Efficiency on Correlated Parallel Machine Scheduling Problems,”Operational Research18(3)(2018):603-624. [152][152]Lee J.,Kim B.I.,Johnson A.L.,“The Nuclear Medicine Production and Delivery Problem,”European Journal of Operational Research236(2)(2014):461-472. [153][153]Laporte G.,“The Vehicle Routing Problem:An Overview of Exact and Approximate Algorithms,”European Journal of Operational Research59(3)(1992):345-358. [154][154]Laporte G.,Mercure H.,Nobert Y.,“An Exact Algorithm for the Asymmetrical Capacitated Vehicle Routing Problem,”Networks16(1)(1986):33-46. [155][155]Laporte G.,Mercure H.,Nobert Y.,“A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems,”Journal of the Operational Research Society43(5)(1992):469-481. [156][156]Laporte G.,Nobert Y.,Desrochers M.,“Optimal Routing Under Capacity and Distance Restrictions,”Operations Research33(5)(1985):1050-1073. [157][157]Li K.,Sivakumar A.I.,Ganesan V.K.,“Complexities and Algorithms for Synchronized Scheduling of Parallel Machine Assembly and Air Transportation in Consumer Electronics Supply Chain,”European Journal of Operational Research187(2)(2008):442-455. [158][158]Li C.L.,Vairaktarakis G.,“Coordinating Production and Distribution of Jobs with Bundling Operations,”Iie Transactions 39(2)(2007):203-215. [159][159]Lai P.J.,Lee W.C.,“Single-machine Scheduling with Learning and Forgetting Effects,”Applied Mathematical Modeling 37(6)(2013):4509-4516. [160][160]Liu P.,Yi N.,Zhou X.,“Scheduling Two Agents with Sum-of-processing-times-based Deterioration on a Single Machine,”Applied Mathematics & Computation219(17)(2013):8848-8855. [161][161]Li S.,Yuan J.,“Scheduling with Families of Jobs and Delivery Coordination under Job Availability,”Theoretical Computer Science410(47)(2009):4856-4863. [162][162]Li S.,Yuan J.,Fan B.,“Unbounded Parallel-batch Scheduling with Family Jobs and Delivery Coordination,”Information Processing Letters111(12)(2011):575-582.,“ [163][163]Leung J.Y.T.,Chen Z.L.,“Integrated Production and Distribution with Fixed Delivery Departure Dates,”Operations Research Letters41(3)(2013):290-293. [164][164]Lysgaard J.,Wøhlk S.,“A Branch-and-cut-and-price Algorithm for the Cumulative Capacitated Vehicle Routing Problem,”European Journal of Operational Research 236(3)(2014):800-810. [165][165]Luo Z.,Qin H.,Lim A.,“Branch-and-price-and-cut for the Multiple Traveling Repairman Problem with Distance Constraints,”European Journal of Operational Research234(1)(2014):49-60. [166][166]Liaw C.F.,“A Hybrid Genetic Algorithm for the Open Shop Scheduling Problem,”European Journal of Operational Research124(1)(2000):28-42. [167][167]Liu R.,Yuan B.,Jiang Z.,“Mathematical Model and Exact Algorithm for the Home Care Worker Scheduling and Routing Problem with Lunch Break Requirements,”International Journal of Production Research55(2)(2017):558-575. [168][168]Low C.,Li R.K.,Chang C.M.,“Integrated Scheduling of Production and Delivery with Time Windows,”International Journal of Production Research51(3)(2013):897-909. [169][169]Li K.,Ganesan V.,Sivakumar A.,“Synchronized Scheduling of Assembly and Multi-destination Air-transportation in a Consumer Electronics Supply Chain,”International Journal of Production Research43(13)(2005):2671-2685. [170][170]Li K.,Ganesan V.K.,Sivakumar A.I.,“Scheduling of Single Stage Assembly with Air Transportation in a Consumer Electronic Supply Chain,”Computers & Industrial Engineering51(2)(2006):264-278. [171][171]Lee C.Y.,Chen Z.,“Machine Scheduling with Transportation Considerations,”Journal of Scheduling4(1)(2001):3-24. [172][172]Li C.L.,Vairaktarakis G.,Lee C.Y.,“Machine Scheduling with Deliveries to Multiple Customer Locations,”European Journal of Operational Research164(1)(2005):39-51. [173][173]Lu L.,Yuan J.,Zhang L.,“Single Machine Scheduling with Release Dates and Job Delivery to Minimize the Makespan,”Theoretical Computer Science393(1)(2008):102-108. [174][174]Lalla-Ruiz E.,Stefan Voß.,“Modeling the Parallel Machine Scheduling Problem with Step Deteriorating Jobs,”European Journal of Operational Research255(1)(2016):21-33. [175][175]Mensendiek A.,Gupta J.N.D.,Herrmann J .,“Scheduling Identical Parallel Machines with Fixed Delivery Dates to Minimize Total Tardiness,”European Journal of Operational Research243(2)(2015):514-522. [176][176]Montoyatorres J.R. et al.,“A Literature Review on the Vehicle Routing Problem with Multiple Depots,”Computers & Industrial Engineering79(2015):115-129. [177][177]Maffioli F.,“The Vehicle Routing Problem:a Book Review,”Quarterly Journal of the Belgian French & Italian Operations Research Societies1(2)(2003):149-153. [178][178]Manoj U.V.,Gupta J.N.D.,Gupta S.K.,“Supply Chain Scheduling:Just-in-time Environment,”Annals of Operations Research161(1)(2008):53-86. [179][179]Ma W.,Liu Y.,Zhang X.,“A New Model and Algorithm for Uncertain Random Parallel Machine Scheduling Problem,”Soft Computing,(2018):1-12. [180][180]Mazdeh M.M. et al.,“Single-machine Batch Scheduling Minimizing Weighted Flow Times and Delivery Costs,”Applied Mathematical Modelling 35(1)(2011):563-570. [181][181]Mladenovi N.,Uroševi D.,Ili A.,“A General Variable Neighborhood Search for the One-commodity Pickup-and-delivery Travelling Salesman Problem,” European Journal of Operational Research220(1)(2012):270-285. [182][182]Melo R.A,Wolsey L.A.,“Optimizing Production and Transportation in a Commit-to-delivery Business Mode,”European Journal of Operational Research203(3)(2010):614-618. [183][183]Mastrolilli M.,“Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times,”Journal of Scheduling6(6)(2003):521-531. [184][184]Mula J.,Peidro D.,Díaz-Madroñero M.,“Mathematical Programming Models for Supply Chain Production and Transport Planning,”European Journal of Operational Research204(3)(2010):377-390. [185][185]Moscato P.,Cotta C.,A Modern Introduction to Memetic Algorithms (New York:Springer,2010). [186][186]Marinakis Y.,Marinaki M.,Bumble Bees Mating Optimization Algorithm for the Vehicle Routing Problem (New York:Springer,2010). [187][187]Mladenovi N.,Hansen P.,“Variable Neighborhood Search,”Computers & Operations Research 24(11)(1997):1097-1100. [188][188]Marinakis Y.,Marinaki M.,“A Hybrid Genetic-particle Swarm Optimization Algorithm for the Vehicle Routing Problem,”Expert Systems with Applications37(2)(2010):1446-1455. [189][189]Malandraki C.,Daskin M.S.,“Time Dependent Vehicle Routing Problems:Formulations,Properties and Heuristic Algorithms,”Transportation Science26(3)(1992):185-200. [190][190]Maxwell W.L.,“The Scheduling of Single Machine Systems:A Review,”International Journal of Production Research3(3)(1964):23. [191][191]Ng C.,Lu L.,“On-line Integrated Production and Outbound Distribution Scheduling to Minimize the Maximum Delivery Completion Time,”Journal of Scheduling15(3)(2012):391-398. [192][192]Ngueveu S.U.,Prins C.,Calvo R.W.,“An Effective Memetic Algorithm for the Cumulative Capacitated Vehicle Routing Problem,”Computers & Operations Research37(11)(2010):1877-1885. [193][193]Nesello V. et al.,“Exact Solution of the Single-machine Scheduling Problem with Periodic Maintenances and Sequence-dependent Setup Times,”European Journal of Operational Research,266(1)(2018):498-507. [194][194]Ou J.,Zhong X.,Wang G.,“An Improved Heuristic for Parallel Machine Scheduling with Rejection,”European Journal of Operational Research,241(3)(2015):653-661. [195][195]Oyola J.,Arntzen H.,Woodruff D.L .,“The Stochastic Vehicle Routing Problem,a Literature Review,Part I:Solution Methods,”Euro Journal on Transportation & Logistics6(4)(2017):1-40. [196][196]Oyola J.,Arntzen H.,Woodruff D.L.,“The Stochastic Vehicle Routing Problem,a Literature Review,Part I:Models,”Euro Journal on Transportation and Logistics7(2018):193-221. [197][197]Ouaddi K.,Benadada Y.,Mhada F.Z .,“Multi Period Dynamic Vehicles Routing Problem:Literature Review,Modelization and Resolution,”IEEE,IEEE International Conference On Logistics Operations Management (2016),pp.1-22. [198][198]Osman I.H.,“Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem,”Annals of Operations Research 41(4)(1993):421-451. [199][199]Prins C.,“A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem,”Computers & Operations Research31(12)(2004):1985-2002. [200][200]Prins C.,Lacomme P.,Prodhon C.,“Order-first Split-second Methods for Vehicle Routing Problems:A Review,”Transportation ResearchPart C 40(1)(2014):179-200. [201][201]Potvin J.Y.,“Evolutionary Algorithms for Vehicle Routing,”Informs Journal on Computing21(4)(2009):518-548. [202][202]Pillac V.,Gendreau M.,Guéret,Christelle,“A Review of Dynamic Vehicle Routing Problems,”European Journal of Operational Research 225(1)(2013):1-11. [203][203]Pakzad-moghaddam S.H.,Tavakkoli-moghaddam R.,Mina H.,“An Approach for Modeling a New Single Machine Scheduling Problem with Deteriorating and Learning Effects,”Computers & Industrial Engineering78(4)(2014):33-43. [204][204]Poli R.,Kennedy J.,Blackwell T.,“Particle Swarm Optimization,”Swarm Intelligence1(1)(2007):33-57. [205][205]Prins C.,A Grasp Evolutionary Local Search Hybrid for the Vehicle Routing Problem (New York:Springer,2009). [206][206]Perboli G.,Pezzella F.,Tadei R.,“Eve-opt:A Hybrid Algorithm for the Capacitated Vehicle Routing Problem,”Mathematical Methods of Operations Research68(2)(2008):361-382. [207][207]Pan J.C.H.,Wu C.L.,Huang H.C.,“Coordinating Scheduling with Batch Deliveries in a Two-machine Flow Shop,”the International Journal of Advanced Manufacturing Technology 40(5-6)(2009):607-616. [208][208]Pisinger D.,“A General Heuristic for Vehicle Routing Problems,”Computers & Operations Research34(8)(2007):2403-2435. [209][209]Pundoor G.,Chen Z.L.,“Scheduling a Production-Distribution System to Optimize the Tradeoff Between Delivery Tardiness and Distribution Cost,”Naval Research Logistics52(6)(2005):571-589. [210][210]Quan O.Y.,Xu H.Y.,“The Review of the Single Machine Scheduling Problem and Its Solving Methods,”Applied Mechanics and Materials4(2013):411-414. [211][211]Ropke S.,Pisinger D.,“An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows,”Transportation Science40(4)(2006):455-472. [212][212]Rivera J.C.,Afsar H.M.,Prins C.,“A Multistart Iterated Local Search for the Multitrip Cumulative Capacitated Vehicle Routing Problem,”Computational Optimization and Applications 61(1)(2015):159-187. [213][213]Ribeiro G.M.,Laporte G.,“An Adaptive Large Neighborhood Search Heuristic for the Cumulative Capacitated Vehicle Routing Problem,”Computers & Operations Research 39(3)(2012):728-735. [214][214]Rasti-Barzoki M.,Hejazi S.R.,“Minimizing the Weighted Number of Tardy Jobs with Due Date Assignment and Capacity-constrained Deliveries for Multiple Customers in Supply Chains,”European Journal of Operational Research228(2)(2013):345-357. [215][215]Rasti-Barzoki M.,Hejazi S.R.,Mazdeh M.M.,“A Branch and Bound Algorithm to Minimize the Total Weighed Number of Tardy Jobs and Delivery Costs,”Applied Mathematical Modelling37(7)(2013):4924-4937. [216][216]Resende M.G. et al.,Scatter Search and Path-relinking:Fundamentals,Advances,and Applications (New York:Springer,2010). [217][217]Srivatsa Srinivas S.,Gajanand M.S.,“Vehicle Routing Problem and Driver Behaviour:A Review and Framework for Analysis,”Transport Reviews37(5)(2017):1-22. [218][218]Sharma S.K.,Routroy S.,Yadav U.,“Vehicle Routing Problem(VRP)for Courier Service:A Review,”International Journal of Operational Research 1(33)(2018):1-31. [219][219]Solomon M.M.,“Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints,”Operations Research35(2)(1987):254-26. [220][220]Shrouf F.,Ordieres-Meré J.,García-Sánchez A.,“Optimizing the Production Scheduling of a Single Machine to Minimize Total Energy Consumption Costs,”Journal of Cleaner Production67(2014):197-207. [221][221]Subramanian A.,Uchoa E.,Ochi L.S.,“A Hybrid Algorithm for a Class of Vehicle Routing Problems,”Computers & Operations Research40(10)(2013):2519-2531. [222][222]Selvarajah E.,Steiner G.,“Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs,”Operations Research57(2)(2009):426-438. [223][223]Steiner G.,Zhang R.,“Approximation Algorithms for Minimizing the Total Weighted Number of Late Jobs with Late Deliveries in Two-level Supply Chains,”Journal of Scheduling12(6)(2009):565-574. [224][224]Salehipour A.,Sörensen K.,Goos P.,“Efficient Grasp+Vnd and Grasp+Vns Metaheuristics for the Traveling Repairman Problem,”4 Or Quarterly Journal of the Belgian French & Italian Operations Research Societies9(2)(2011):189-209. [225][225]Sariklis D.,Powell S.,“A Heuristic Method for the Open Vehicle Routing Problem,”Journal of the Operational Research Society51(5)(2000):564-573. [226][226]Salehipour A.,Sörensen K.,Goos P.,An Efficient GRASP+ VND Metaheuristic for the Traveling Repairman Problem(University of Antwerp,2008). [227][227]Stalk G.,Competing Against Time:How Time-based Competition Is Reshaping Global Market (Newyork:Simon and Schuster,1990). [228][228]Sarmiento A.M.,Nagi R.,“A Review of Integrated Analysis of Production-distribution Systems,”IIE Transactions31(11)(1999):1061-1074. [229][229]Stecke K.E.,Zhao X.,“Production and Transportation Integration for a Make-to-order Manufacturing Company with a Commit-to-delivery Business Mode,”Manufacturing & Service Operations Management9(2)(2007):206-224. [230][230]Schmid V. et al.,“A Hybrid Solution Approach for Ready-mixed Concrete Delivery,”Transportation Science43(1)(2009):70-85. [231][231]Schmid V.,Et al.,“Hybridization of Very Large Neighborhood Search for Ready-mixed Concrete Delivery Problems,”Computers & Operations Research37(3)(2010):559-574. [232][232]Shen P.,Wei C.M.,Huang X .,“Single-machine Scheduling Problems with an Actual Time-dependent Deterioration,”Applied Mathematical Modeling37(7)(2013):5555-5562. [233][233]Sels V.,Craeymeersch K.,Vanhoucke M.,“A Hybrid Single and Dual Population Search Procedure for the Job Shop Scheduling Problem,”European Journal of Operational Research215(3)(2011):512-523. [234][234]Shrouf F.,Joaquin Ordieres-meré,Alvaro García-sánchez,“Optimizing the Production Scheduling of a Single Machine to Minimize Total Energy Consumption Costs,”Journal of Cleaner Production 67(6)(2014):197-207. [235][235]Taillard E.,“Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem,”European Journal of Operational Research47(1)(1990):65-74. [236][236]Thomas D.J.,Griffin P M.,“Coordinated Supply Chain Management,”European Journal of Operational Research94(1)(1996):1-15. [237][237]Tanaka S.,Araki M.,“An Exact Algorithm for the Single-machine Total Weighted Tardiness Problem with Sequence-dependent Setup Times,”Computers & Operations Research40(1)(2013):344-352. [238][238]Tanaka S.,Sato S.,“An Exact Algorithm for the Precedence-Constrained Single-machine Scheduling Problem,”European Journal of Operational Research 229(2)(2013):345-352. [239][239]Toth P.,Vigo D.,“The Granular Tabu Search and Its Application to the Vehicle-routing Problem,”Journal on Computing15(4)(2003):333-346. [240][240]Toth P.,Vigo D.,The Vehicle Routing Problem (Philadelphia:Siam,2001). [241][241]Toptal A.,Koc U.,“Sabuncuoglu I.A Joint Production and Transportation Planning Problem with Heterogeneous Vehicles,”Journal of the Operational Research Society 65(2)(2013):180-196. [242][242]Ullrich C.A.,“Integrated Machine Scheduling and Vehicle Routing with Time Windows,”European Journal of Operational Research227(1)(2013):152-165. [243][243]Ullrich C.A.,“Supply Chain Scheduling:Makespan Reduction Potential,”International Journal of Logistics Research and Applications15(5)(2012):323-336. [244][244]Van Buer M.G.,Woodruff D.L.,Olson R.T.,“Solving the Medium Newspaper Production/Distribution Problem,”European Journal of Operational Research 115(2)(1999):237-253. [245][245]Viergutz C.,Knust S.,“Integrated Production and Distribution Scheduling with Lifespan Constraints,”Annals of Operations Research213(1)(2014):293-318. [246][246]Wang G.,Cheng T.C.E.,“Parallel Machine Scheduling with Batch Delivery Costs,”International Journal of Production Economics68(2)(2000):177-183. [247][247]Vidal T.,Crainic T.G.,Gendreau M.,“A Unified Solution Framework for Multi-attribute Vehicle Routing Problems,”European Journal of Operational Research234(3)(2014):658-673. [248][248]Vallada E.,Ruiz R.,“A Genetic Algorithm for the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times,”European Journal of Operational Research211(3)(2011):612-622. [249][249]Vahit Kaplanolu.,“Multi-agent Based Approach for Single Machine Scheduling with Sequence-dependent Setup Times and Machine Maintenance,”Applied Soft Computing23(2014):165-179. [250][250]Valente J.M.S.,Moreira M.R.A.,Singh A.,“Genetic Algorithms for Single Machine Scheduling with Quadratic Earliness and Tardiness Costs,”The International Journal of Advanced Manufacturing Technology54(2011):251-265. [251][251]Wang H.,Lee C.Y.,“Production and Transport Logistics Scheduling with Two Transport Mode Choices,”Naval Research Logistics52(8)(2005):796-809. [252][252]Wang X.,Cheng T.C.,“Machine Scheduling with an Availability Constraint and Job Delivery Coordination,”Naval Research Logistics54(1)(2007):11-20. [253][253]Wang X.,Cheng T.C.E.,“Production Scheduling with Supply and Delivery Considerations to Minimize the Makespan,”European Journal of Operational Research 194(3)(2009):743-752. [254][254]Wang L.,Liu Z.,“Single Machine Scheduling with Batch Delivery to Multiple Customers in Astar-shaped Network,”Asia-Pacific Journal of Operational Research2(12)(2013):1040-1043. [255][255]Wang X.,Tang L.,“A Hybrid Metaheuristic for the Prize-collecting Single Machine Scheduling Problem with Sequence-dependent Setup Times,” Computers & Operations Research37(9)(2010):1624-1640. [256][256]Wu C.C.,Lee W.C.,Liou M.J.,“Single-machine Scheduling with Two Competing Agents and Learning Consideration,”Information Sciences251(2013(A)):136-149. [257][257]Wu C.C.,Cheng S.R.,Wu W.H.,“The Single-machine Total Tardiness Problem with Unequal Release Times and a Linear Deterioration,”Applied Mathematics & Computation219(20)(2013(B)):10401-10415. [258][258]Wang J.J.,Liu Y.J.,“Single-machine Bicriterion Group Scheduling with Deteriorating Setup Times and Job Processing Times,”Applied Mathematics and Computation242(Complete)(2014):309-314. [259][259]Wang D.,Yin Y.,Cheng T.C.E.,“Parallel-machine Rescheduling with Job Unavailability and Rejection,”Omega81(2018):246-260. [260][260]Xu H.,Lü Z.,Yin A.,“A Study of Hybrid Evolutionary Algorithms for Single Machine Scheduling Problem with Sequence-dependent Setup Times,”Computers & Operations Research50(2014):47-60. [261][261]Xue P.,Zhang Y.,Yu X.,“Single-machine Scheduling with Piece-rate Maintenance and Interval Constrained Position-dependent Processing Times,”Applied Mathematics and Computation226(2014):415-422. [262][262]Xu Y.T.,Zhang Y.,Huang X.,“Single-machine Ready Times Scheduling with Group Technology and Proportional Linear Deterioration,”Applied Mathematical Modeling38(1)(2014):384-391. [263][263]Xu H.,Lü Zhipeng,Yin A.,“A Study of Hybrid Evolutionary Algorithms for Single Machine Scheduling Problem with Sequence-dependent Setup Times,”Computers & Operations Research50(10)(2014):47-60. [264][264]Yuan J.,“A Note on the Complexity of Single-machine Scheduling with a Common Due Date,Earliness-tardiness,and Batch Delivery Costs,”European Journal of Operational Research 94(1)(1996):203-205. [265][265]Yan C.,Banerjee A.,Yang L.,“An Integrated Production-distribution Model for a Deteriorating Inventory Item,”International Journal of Production Economics133(1)(2011):228-232. [266][266]Yin Y.,Wang Y.,Cheng T.C.E.,“Parallel-machine Scheduling of Deteriorating Jobs with Potential Machine Disruptions,”Omega69(2017):17-28. [267][267]Yellow P.,“A Computational Modification to the Savings Method of Vehicle Scheduling,”Operational Research Quarterly21(2)(1970):281-283. [268][268]Zhou F.,Blocher J.D.,Hu X.,“Optimal Single Machine Scheduling of Products with Components and Changeover Cost,”European Journal of Operational Research233(1)(2014):75-83. [269][269]Zhong W.,Dósa G.,Tan Z.,“On the Machine Scheduling Problem with Job Delivery Coordination,”European Journal of Operational Research182(3)(2007):1057-1072. [270][270]Zachariadis E.E.,Tarantilis C.D.,Kiranoudis C.T.,“Designing Vehicle Routes for a Mix of Different Request Types,Under Time Windows and Loading Constraints,”European Journal of Operational Research229(2)(2013):303-317. [271][271]Zhang R.,Song S.,Wu C.,“A Hybrid Artificial Bee Colony Algorithm for the Job Shop Scheduling Problem,”International Journal of Production Economics 141(1)(2013):167-178. [272][272]Zhang Q.,Wei L.R.,Hu R.,“A Review on the Bin Packing Capacitated Vehicle Routing Problem,”Advanced Materials Research853(2014):668-673.
[展开]

相关推荐

发表评论

同步转发到先晓茶馆

发表评论

手机可扫码阅读