检索结果-南通市图书馆

parallel machine scheduling with Special Jobs

在线全文

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2006年第1期11卷 107-110页

作者：王振波邢文训 Department of Mathematical Sciences Tsinghua UniversityBeijing 100084 China

This paper considers parallel machine scheduling with special jobs. Normal jobs can be processed on any of the parallel machines, while the special jobs can only be processed on one machine. The problem is analyzed for various manufacturing conditions and service requirements. The off-line scheduling problem is transformed into a classical parallel machine scheduling problem. The on-line scheduling uses the FCFS （first come, first served）, SWSC （special window for special customers）, and FFFS （first fit, first served） algorithms to satisfy the various requirements. Furthermore, this paper proves that FCFS has a competitive ratio of m, where m is the number of parallel machines, and this bound is asymptotically tight, SWSC has a competitive ratio of 2 and FFFS has a competitive ratio of 3- 2/m, and these bounds are tight.

关键词： parallel machine scheduling on-line worst-case analysis heuristics

Dynamical Artificial Bee Colony for Energy-Efficient Unrelated parallel machine scheduling with Additional Resources and Maintenance

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第10期81卷 843-866页

作者： Yizhuo Zhu Shaosi He Deming Lei School of Science Hong Kong University of Science and TechnologyHong Kong999077China School of Automation Wuhan University of TechnologyWuhan430070China

Unrelated parallel machine scheduling problem(UPMSP)is a typical scheduling one and UPMSP with various reallife constraints such as additional resources has been widely studied;however,UPMSP with additional resources,maintenance,and energy-related objectives is seldom *** Artificial Bee Colony(ABC)algorithm has been successfully applied to various production scheduling problems and demonstrates potential search advantages in solving UPMSP with additional resources,among other *** this study,an energy-efficient UPMSP with additional resources and maintenance is considered.A dynamical artificial bee colony(DABC)algorithm is presented to minimize makespan and total energy consumption *** heuristics are applied to produce the initial *** bee swarm and onlooker bee swarm are *** resources are shifted from the dominated solutions to non-dominated solutions in each swarm when the given condition is *** employed bee phase is implemented by computing resource shifting and solution *** resource shifting and feedback are used to construct dynamical onlooker bee *** experiments are conducted on 300 instances from the literature and three comparative algorithms and ABC are compared after parameter settings of all algorithms are *** computational results demonstrate that the new strategies of DABC are effective and that DABC has promising advantages in solving the considered UPMSP.

关键词： Artificial bee colony parallel machine scheduling energy additional resource

A parallel machine scheduling Model Based Data scheduling Scheme for P2P Media Streaming System

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A Parallel Machine Scheduling Model Based Data Scheduling Sc...

An effective estimation of distribution algorithm for parallel litho machine scheduling with reticle constraints

2009 International Conference on Modeling, Simulation and Optimization

作者： JI Qi-Jin,YANG Zhe,ZHU Yan-Yin School of Computer Science and Technology Soochow University Suzhou,China

Data scheduling in a data-driven peer-to-peer(P2P) media streaming system decide the sequence of chunk selection (chunk scheduling) and which peer to choose for the selected chunks(peer scheduling).In this paper,a novel parallel scheduling model based data scheduling scheme is designed,in which as many as possible chunks are requested in a scheduling period and the available peers are assigned to these scheduled chunks simultaneously with load-balance in mind. The analysis and simulation results show that our data scheduling scheme makes better tradeoff between system performance and scalability and can improve the streaming quality while reducing the traffic load of source server effectively comparing with CoolStreaming[1]like systems.

关键词： media streaming peer-to-peer data scheduling parallel machine scheduling

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

High Technology Letters 2016年第1期22卷 47-54页

作者：周炳海 Zhong Zhenyi School of Mechanical Engineering Tongji University

In order to improve the scheduling efficiency of photolithography,bottleneck process of wafer fabrications in the semiconductor industry,an effective estimation of distribution algorithm is proposed for scheduling problems of parallel litho machines with reticle constraints,where multiple reticles are available for each reticle ***,the scheduling problem domain of parallel litho machines is described with reticle constraints and mathematical programming formulations are put forward with the objective of minimizing total weighted completion ***,estimation of distribution algorithm is developed with a decoding scheme specially designed to deal with the reticle ***,an insert-based local search with the first move strategy is introduced to enhance the local exploitation ability of the ***,simulation experiments and analysis demonstrate the effectiveness of the proposed algorithm.

关键词： semiconductor manufacturing parallel machine scheduling auxiliary resource constraints estimation of distribution algorithm

scheduling an Energy-Aware parallel machine System with Deteriorating and Learning Effects Considering Multiple Optimization Objectives and Stochastic Processing Time

在线全文

学校读者我要写书评

暂无评论

Computer Modeling in Engineering & Sciences 2023年第4期135卷 325-339页

作者： Lei Wang Yuxin Qi School of Event and Economic Management Shanghai Institute of TourismShanghai201418China School of Tourism Shanghai Normal UniversityShanghai201418China

Currently,energy conservation draws wide attention in industrial manufacturing *** recent years,many studies have aimed at saving energy consumption in the process of manufacturing and scheduling is regarded as an effective *** paper puts forwards a multi-objective stochastic parallel machine scheduling problem with the consideration of deteriorating and learning *** it,the real processing time of jobs is calculated by using their processing speed and normal processing *** describe this problem in a mathematical way,amultiobjective stochastic programming model aiming at realizing makespan and energy consumption minimization is ***,we develop a multi-objective multi-verse optimization combined with a stochastic simulation method to deal with *** this approach,the multi-verse optimization is adopted to find favorable solutions from the huge solution domain,while the stochastic simulation method is employed to assess *** conducting comparison experiments on test problems,it can be verified that the developed approach has better performance in coping with the considered problem,compared to two classic multi-objective evolutionary algorithms.

关键词： Energy consumption optimization parallel machine scheduling multi-objective optimization deteriorating and learning effects stochastic simulation

Optimal online algorithms for scheduling on two identical machines under a grade of service

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Zhejiang University-Science A(Applied Physics & Engineering) 2006年第3期7卷 309-314页

作者：蒋义伟何勇唐春梅 Laboratory of Information and Optimization Technologies Ningbo Institute of Technology Zhejiang University Ningbo 315100 China Department of Mathematics Zhejiang University Hangzhou 310027 China Department of Mathematics Zhejiang University Hangzhou 310027 China

This work is aimed at investigating the online scheduling problem on two parallel and identical machines with a new feature that service requests from various customers are entitled to many different grade of service (GoS) levels, so each job and machine are labelled with the GoS levels, and each job can be processed by a particular machine only when its GoS level is no less than that of the machine. The goal is to minimize the makespan. For non-preemptive version, we propose an optimal online al-gorithm with competitive ratio 5/3. For preemptive version, we propose an optimal online algorithm with competitive ratio 3/2.

关键词： Online algorithm Competitive analysis parallel machine scheduling Grade of service (GoS)