检索结果-内蒙古大学图书馆

Planning approximations to the average length of vehicle routing problems with time window constraints

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2009年第4期43卷 438-447页

作者： Figliozzi, Miguel Andres Portland State Univ Coll Engn & Comp Sci Dept Civil Engn Portland OR 97207 USA

This paper studies approximations to the average length of vehicle routing problems (VRP) with time window, route duration, and capacity constraints. The approximations are valuable for the strategic and planning analysis of transportation and logistics problems. Using asymptotic properties of vehicle routing problems and the average probability of successfully sequencing a customer with time windows a new expression to estimate VRP distances is developed. The increase in the number of routes when time constraints are added is modeled probabilistically. This paper introduces the concept of the average probability of successfully sequencing a customer with time windows. It is proven that this average probability is a unique characteristic of a vehicle routing problem. The approximation proposed is tested in instances with different customer spatial distributions, depot locations and number of customers. Regression results indicate that the proposed approximation is not only intuitive but also predicts the average length of VRP problems with a high level of accuracy. (C) 2008 Elsevier Ltd. All rights reserved.

关键词： Vehicle routing problem Distance estimation time window constraints

来源：评论

学校读者我要写书评

暂无评论

Scheduling method of robotic cells with machine-robot process and time window constraints

引用

PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART E-JOURNAL OF PROCESS MECHANICAL ENGINEERING 2018年第6期232卷 650-661页

作者： Zhou, Bing-hai Li, Ming Tongji Univ Sch Mech Engn 4800 Caoan Highway Shanghai 201804 Peoples R China

Robotic cells are widely used in the fields of incorporate automation and repetitive processing. Throughput analysis and scheduling of robotic cells with machine process have been well studied, while research work on robotic cells with machine-robot process in which robots concurrently perform collaborated tasks in addition to part transportation is still at an early stage. After defining the concepts of internal and external time window constraints, we propose a robotic cell scheduling problem with machine process and machine-robot process simultaneously, when processing time window is an essential constraint. According to the constraints in real engineering practice, a mathematic model of single-gripper robotic cells is established to minimize the average manufacturing cycle time. A shifting bottleneck searching algorithm is proposed based on the basis of analyses. In addition, a lower bound for the average manufacturing cycle time is established. Finally, through extensive simulation experiments, the numerical and experimental results demonstrate that the shifting bottleneck searching provides optimal or near optimal solutions.

关键词： Machine-robot processing robotic cells time window constraints scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-degree cyclic hoist scheduling with time window constraints

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2011年第19期49卷 5679-5693页

作者： Che, Ada Zhou, Zhen Chu, Chengbin Chen, Haoxun NW Polytech Univ Sch Management Xian 710072 Peoples R China Ecole Cent Paris Lab Genie Ind F-92295 Chatenay Malabry France Univ Technol Troyes Lab LOSI F-10010 Troyes France

This paper deals with the multi-degree cyclic single-hoist scheduling problem with time window constraints, in which multiple identical parts enter and leave the system during each cycle. We propose an analytical mathematical model and a branch-and-bound algorithm so as to find a cyclic sequence of hoist moves that maximises the throughput. The branch-and-bound algorithm implicitly enumerates the sequence of hoist moves and requires the solution of a specific set of linear programming problems (LPPs). Computational results on benchmark instances and randomly generated test instances are presented.

关键词： cyclic hoist scheduling multi-degree time window constraints branch-and-bound

来源：评论

学校读者我要写书评

暂无评论

Cyclic scheduling of a hoist with time window constraints

引用

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION 1998年第1期14卷 144-152页

作者： Chen, HX Chu, CB Proth, JM Xian Univ INRIA Lorraine Syst Engn Inst Xian Peoples R China Univ Magdeburg D-39106 Magdeburg Germany Univ Technol Troyes F-10010 Troyes France INRIA Lorraine F-57070 Metz France Univ Maryland Syst Res Inst College Pk MD 20742 USA

This paper proposes a model and a related algorithm for generating optimal cyclic schedules of hoist moves with time window constraints in a printed circuit board (PCB) electroplating facility. The algorithm is based on the branch and bound approach and requires the solution of a specific class of linear programming problems (LPP's), These LPP's are equivalent to the problems of the cycle time evaluation in bi-valued graphs, Computational experience is presented to compare the results obtained using this new algorithm with the ones proposed in the literature.

关键词： Bi-valued graph branch-and-bound cycle time hoist scheduling time window constraints

来源：评论

学校读者我要写书评

暂无评论

Scheduling in robotic cells with time window constraints

引用

EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING 2021年第2期15卷 206-225页

作者： Zahrouni, Wassim Kamoun, Hichem Northern Border Univ Coll Business Adm POB 1321 Ar Ar 91431 Saudi Arabia Univ Carthage FSEG Nabeul Hammamet St 8000 Nabeul Tunisia Univ Sfax FSEG Sfax MODILS Lab Route 1 AerodromeKm 4BP-1088 Sfax 3018 Tunisia

This paper addresses the cyclic scheduling problem arising in two and three-machine robotic cells with time window constraints where multiple part-types are produced. Due to its complexity, very few studies have tackled the problem. Previous researches were generally limited to single or at most to two part-types where the associated part sequencing problem vanishes since the production is cyclic. We proved that the two-machine problem could be apprehended as a travelling salesman problem. For the three-machine case, we proposed a heuristic aimed at finding the sequence of robot activities and the sequence of parts that jointly minimises the cycle time in a special class of cycles. A lower bound is also provided, and computational results are reported.

关键词： hoist scheduling problem HSP robotic cells time window constraints cyclic scheduling sequencing

来源：评论

学校读者我要写书评

暂无评论

Multiresource fair allocation with time window constraints

引用

JOURNAL OF SUPERCOMPUTING 2023年第14期79卷 15927-15954页

作者： Li, Xingxing Li, Weidong Zhang, Xuejie Yunnan Univ Sch Informat Sci & Engn Kunming 650500 Peoples R China Yunnan Univ Sch Math & Stat Kunming 650500 Peoples R China

We study the problem of multiresource fair allocation with time window constraints for user tasks in cloud computing systems where users can enter and leave the system multiple times. We propose a new mechanism, dominant resource fairness with time window constraints (DRFTW), that extends the concepts of dominant resource fairness and lexicographically max-min fairness to the case where user tasks have time window constraints. We design an algorithm for DRFTW to produce the optimal allocations. DRFTW has several highly desirable properties: no user can improve its performance without making at least one other user worse off;no user prefers even allocations;no user envies other users' allocations;and no user can increase its utility by providing false information. Simulations driven by Alibaba Cluster Trace further revealed that DRFTW can significantly increase the minimum dominant share and improve fairness among users compared with three conventional fair allocation methods.

关键词： Cloud computing Multiresource fair allocation Dominant share fairness time window constraints Lexicographically max-min

来源：评论

学校读者我要写书评

暂无评论

Plant-wide optimal scheduling of multi-grade PET production with time window constraints: A hybrid discrete/continuous-time optimization formulation

引用

COMPUTERS & CHEMICAL ENGINEERING 2024年 186卷

作者： Du, Chenge Dai, Xin Wang, Zhenlei Fan, Chen Chang, Hongtao East China Univ Sci & Technol Key Lab Smart Mfg Energy Chem Proc Minist Educ Shanghai 200237 Peoples R China East China Univ Sci & Technol State Key Lab Ind Control Technol Shanghai 200237 Peoples R China Sinopec Yizheng Chem Fibre Co Ltd Yizheng 211900 Jiangsu Peoples R China

Plant -wide scheduling optimization of multi -grade PET production is of great significance for increasing the economic benefits and market competitiveness of PET plants. However, dealing with changeover operations between the production of products with different grades is challenging due to multiple timing limitations in the actual process. This study proposes a novel plant -wide scheduling optimization model for multigrade PET production. The model focuses on three major categories of products, namely PET fibers, PET chips, and bottle -grade PET. Considering the impacts of nights and weekends on the production, a hybrid discrete/continuous-time representation method is developed to handle changeover operations with time window constraints. Afterward, a multi -objective optimization framework for multi -grade PET production is formulated to balance economic benefits and production stability. Case studies on a real -world PET plant are presented to verify the effectiveness and applicability of the proposed method.

关键词： PET industry Production scheduling Sequence-dependent changeover time window constraints Multi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints

引用

APPLIED MATHEMATICAL MODELLING 2012年第8期36卷 3621-3629页

作者： Zhou, Zhen Che, Ada Yan, Pengyu NW Polytech Univ Sch Management Xian 710072 Peoples R China Univ Elect Sci & Technol China Sch Management & Econ Chengdu 610054 Peoples R China

This paper deals with the cyclic robotic flowshop scheduling problem with time window constraints, where parts are processed successively on multiple machines with upper and lower bounds on processing times and the transportation of parts among the machines is executed by a robot. in contrast with most previous studies, we consider the multi-cyclic scheduling problem in which two or more identical parts enter and leave the robotic flowshop during each cycle. We present the first mixed integer programming (MIP) model for the multi-cyclic robotic flowshop scheduling problem based on the description and analysis of the problem. We solve the model using commercial software CPLEX. Computational experiment on benchmark and randomly generated instances indicates that the proposed MIP approach can effectively solve real-life scheduling problems. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Multi-cyclic scheduling Robotic flowshop Mixed integer programming time window constraints

来源：评论

学校读者我要写书评

暂无评论

Scheduling Single-Blade Cluster Tools with time window constraints

Scheduling Single-Blade Cluster Tools with Time Window Const...

引用

20th Chinese Control and Decision Conference

作者： Li, Linying Hu, Jingtao Chinese Acad Sci Shenyang Inst Automat Shenyang 110016 Peoples R China

ISBN: (纸本)9781424417339

In semiconductor manufacturing, finding an efficient way for scheduling a cluster tools is crucial for productivity improvement and cost reduction. hi this paper, we investigate the cycle scheduling problem with time window constrains in cluster tools. The objective is to minimize the cycle time. To solve the problem, we present a searching algorithm which based on linear programming model and the collision detection strategy. The algorithm uses the fundamental period as controlling parameters to generate all the possible permutations of robot action sequence in the cycle. A linear programming model is then used to find the optimal schedule for each of these permutations based on our constraints. To avoid the collision of robot action, we solve it with slide and stretch strategy. The experiments of Spin Coater demonstrate the effectiveness and efficiency of the proposed algorithm

关键词： Cluster Tools Scheduling time window constraints

来源：评论

学校读者我要写书评

暂无评论

Dynamic community partitioning for e-commerce last mile delivery with time window constraints

引用

COMPUTERS & OPERATIONS RESEARCH 2023年第1期160卷

作者： Ouyang, Zhiyuan Leung, Eric K. H. Cai, Yiji Huang, George Q. Hong Kong Polytech Univ Dept Ind & Syst Engn Hung Hom Hong Kong Peoples R China Univ Liverpool Management Sch Liverpool England Southern Univ Sci & Technol Coll Business Shenzhen Guangdong Peoples R China

Community logistics (CL) is a recently proposed delivery strategy designed to deal with e-commerce last-mile delivery scheduling by dynamically assigning vehicles to designated delivery regions partitioned into "communities". Since optimizing vehicle routes is not mandatory in the CL spectrum, the delivery solution format and optimization process can be greatly simplified. Nevertheless, abandoning vehicle routes means vehicle arrival time at each customer specified delivery destination is unknown, resulting in the inability of handling time window constraints of e-commerce orders. To expand the application scope of CL, this study introduces community time window, an aggregation of identical or adjacent order time windows. Once the community time window for a delivery community is satisfied, all orders in this community can be received within designated time windows without determining vehicle routes. With this new concept, the application range of the CL is extended to e-commerce last mile delivery contexts where order time window constraints are considered. A dynamic community partitioning problem with the time window is presented based on the Markov decision process (MDP). An efficient heuristic solution framework based on policy function approximation is proposed to solve the MDP model. Numerical results show that the CL is very effective in dealing with the time window constraints of e-commerce orders.

关键词： Logistics Last mile delivery Business to customer e-commerce Dynamic community partitioning problem time window constraints

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：