检索结果-南通市图书馆

online scheduling on a Parallel Batch Machine with Delivery Times and Limited Restarts

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2022年第1期10卷 113-131页

作者： Hai-Ling Liu Xi-Wen Lu Department of Mathematics East China University of Science and TechnologyShanghai 200237China College of Science Henan University of EngineeringZhengzhou 451191HenanChina

The online scheduling on an unbounded parallel batch machine with delivery times and limited restarts is studied in this ***,online means that jobs arrive over time and the characteristics of a job become known until it *** restarts mean that once a running batch contains at least one restarted job,it cannot be restarted *** goal is to minimize the time by which all jobs have been *** consider a restricted model that the delivery time of each job is no more than its processing *** present a best possible online algorithm with a competitive ratio of 3/2 for the problem.

关键词： online scheduling Parallel batch Limited restart Delivery time

online scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2019年第2期7卷 303-319页

作者： Jin-Jiang Yuan Li-Li Ren Ji Tian Ru-Yan Fu School of Mathematics and Statistics Zhengzhou UniversityZhengzhou 450001China School of Mathematics China University of Mining and TechnologyXuzhou 221116JiangsuChina

We study an online(over time)scheduling problem on two uniform unbounded parallel-batch machines with processing speed 1 and v(0<≤1),respectively,to minimize the *** first show that no online algorithm can have a com... 详细信息

We study an online(over time)scheduling problem on two uniform unbounded parallel-batch machines with processing speed 1 and v(0online algorithm can have a competitive ratio less than 1+αL,whereαL=(√5−1)/2≈0.618 if 0≤1/2,andαL=α2(v)is the positive root ofα^(3)+3α^(2)+(3−1/v)α−1/v=0 if1/2≤*** lower bound is still valid when all jobs have the same processing ***,we provide an online algorithm with a competitive ratio at most min{(√5+1)/2,√2/v}.When the jobs have the same processing times,we present the best possible online algorithm with a competitive ratio 1+αL.

关键词： online scheduling Uniform parallel-batch machines Makespan Competitive ratio

online scheduling with Unit Processing Times and Processing Set Restrictions

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2019年第3期7卷 475-484页

作者： Yong Chen Guang-Ting Chen Long-Cheng Liu Yi-Wei Jiang Zhi-Yi Tan An Zhang Department of Mathematics Hangzhou Dianzi UniversityHangzhou 310018China School of Electronics and Information Engineering Taizhou UniversityTaizhou 318000ZhejiangChina School of Mathematical Sciences Xiamen UniversityXiamen 361005China Department of Computing Science University of AlbertaEdmontonAB T6G 2R3Canada School of Management and E-Business Zhejiang Gongshang UniversityHangzhou 310018China Department of Mathematics Zhejiang UniversityHangzhou 310027China

This paper investigates online scheduling problems with processing set *** is a sequence of jobs that are revealed one by one over list,where each job has unit processing time.A job can only be processed by a subset of the machines,namely the processing set of the *** objective is to minimize the *** m machines with two different processing sets,we propose an optimal algorithm with a competitive ratio of 3/*** three machines with inclusive processing sets,an optimal algorithm with competitive ratio 5/3 is provided.

关键词： online scheduling Competitive ratio Processing sets

online scheduling of two identical machines under a grade of service provision

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Online scheduling of two identical machines under a grade of...

Integrated schedule of order picking and delivery for instant delivery

第36届中国控制会议

作者： Shuang Cai Ao Liu Ke Liu Academy of Mathematics and Systems Science Chinese Academy of Sciences Key Laboratory Management Decision and Information SystemsCAS University of Chinese Academy of Sciences School of management Wuhan University of Science and Technoledge Hubei Province Key laboratory of Intellegent Information Processing and Real-time Industry System

ISBN: (纸本)9781538629185

In this paper, we consider the problem of two identical machines scheduling that jobs are processed under a grade of service(GoS) provision. The jobs arrive over time and the two machines can be idle at the same time only when all the jobs arrived are completed. To our best knowledge, this problem has never been studied so far. For the problem with objective makespan minimization, we prove that any online algorithm without delay has a competitive ratio of at least (5+1)/***, we develop an algorithm with competitive ratio 5/3, which is a very effective online algorithm.

关键词： online scheduling scheduling of two machines Competitive ratio online algorithm

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Management Science and Engineering 2024年第1期9卷 88-100页

作者： Qiuchen Gu Tijun Fan Jingyi Chen School of Business East China University of Science and TechnologyShanghai200237China Research Center for Operations and Supply Chain Management East China University of Science and TechnologyShanghai200237China Economics and Management School Minjiang UniversityFuzhou350108China

In this study,we introduce an integrated schedule of order picking and delivery for instant *** picking,including order batching and picking sequencing,is scheduled online under real-time order arrival,which integrates order delivery by depicting order location dispersion in an online order picking *** delivery,including delivery person assignment and route planning,is modeled to minimize the total duration of order fulfillment by considering the influence of the order picking completion time.A rule-based online order picking strategy is established,and a customized ant colony optimization(ACO)algorithm is proposed to optimize order *** on 16 simulated instances of different scales demonstrate that our online order picking schedule considering order delivery outperforms existing approaches and that the customized ACO algorithm for order delivery is effective.

关键词： online scheduling Order picking Delivery routing Integrated order picking and delivery Instant delivery

online Over Time scheduling on Parallel-Batch Machines:A Survey

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2014年第4期2卷 445-454页

作者： Ji Tian Ruyan Fu Jinjiang Yuan College of Sciences China University of Mining and TechnologyXuzhou 221116JiangsuChina School of Mathematics and Statistics Zhengzhou UniversityZhengzhou 450001China

online scheduling is a rapidly developed branch in scheduling *** this paper,we present an extensive survey for online over time scheduling on parallel-batch *** open problems are proposed for further research.

关键词： online scheduling Parallel-batch machines Competitive ratio

Hierarchical On-line scheduling of Multiproduct Batch Plants with a Combined Approach of Mathematical Programming and Genetic Algorithm

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Chemical Engineering 2004年第1期12卷 78-84页

作者：陈理王克峰徐霄羽姚平经 Institute of Process Systems Engineering School of Chemical Engineering Dalian University of Technology Dalian 116012 China Department of Chemistry & Chemical Engineering Dalian UniversityDalian 116622China Institute of Process Systems Engineering School of Chemical Engineering Dalian University of Technology Dalian 116012 China Department of Chemistry University of UTAH Salt Lake City UT 84112-2020 USA

In this contribution we present an online scheduling algorithm for a real world multiproduct batch plant. The overall mixed integer nonlinear programming (MINLP) problem is hierarchically structured into a mixed integer linear programming (MILP) problem first and then a reduced dimensional MINLP problem, which are optimized by mathematical programming (MP) and genetic algorithm (GA) respectively. The basis idea relies on combining MP with GA to exploit their complementary capacity. The key features of the hierarchical model are explained and illustrated with some real world cases from the multiproduct batch plants.

关键词： online scheduling multiproduct batch plant mixed integer nonlinear programming mathematical programming genetic algorithm

On-Line scheduling for Jobs with Arbitrary Release Times on Parallel Related Uniform Machines

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Intelligent Information Management 2016年第4期8卷 98-102页

作者： Xiayan Cheng Rongheng Li Yunxia Zhou Department of Mathematics Hunan First Normal University Changsha China Department of Mathematics Key Laboratory of High Performance Computing and Stochastic Information Processing Hunan Normal University Changsha China Department of Computer Hunan Normal University Changsha China

A parallel related uniform machine system consists of m machines with different processing speeds. The speed of any machine is independent on jobs. In this paper, we consider online scheduling for jobs with arbitrary release times on the parallel uniform machine system. The jobs appear over list in terms of order. An order includes the processing size and releasing time of a job. For this model, an algorithm with competitive ratio of 12 is addressed in this paper.

关键词： online scheduling Uniform Machine Competitive Ratio Approximation Algorithm

Prediction-free online Dispatch of Remote Wind-Storage Plant Considering Transmission Congestion

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Prediction-free Online Dispatch of Remote Wind-Storage Plant...