Genetic algorithm for scheduling reentrant jobs on parallel machines with a remote server

This paper considers a reentrant scheduling problem on parallel primary machines with a remote server machine, which is required to carry out the setup operation. In this problem, each job has three operations. The first and last operations are performed by the same primary machine, implying the reentrance, and the second operation is processed on the single server machine. The order of jobs is predetermined in our context. The challenge is to assign jobs to the primary machines to minimize the makespan. We develop a genetic algorithm（GA） to solve this problem. Based on a simple strategy of assigning jobs in batches on the parallel primary machines, the standardized random key vector representation is employed to split the jobs into batches. Comparisons among the proposed algorithm, the branch and bound（BB） algorithm and the heuristic algorithm, coordinated scheduling（CS）, which is only one heuristic algorithm to solve this problem in the literature, are made on the benchmark data. The computational experiments show that the proposed genetic algorithm outperforms the heuristic CS and the maximum relative improvement rate in the makespan is 1.66%.     

THE LAST YET ALSO THE FIRST CREATIVE ACT IN TELEVISION?

A television channel's identity is shaped by its output: not just the relative share of different programme genres but equally so the relative position programmes take up in the schedule. This paper refutes the notion that the development of scheduling strategies and tactics – to make the programme schedules as interesting as possible for viewers – are a product of a commercial and competitive television environment. It will be demonstrated that, from its inception, public service television paid considerable attention to the way in which the actual programme schedules could help establish its cultural–educational broadcasting goals. Taking Flemish public service television between 1953 and 1974 as a case in point, the paper analyses how, first, European public service broadcasting (PSB) created its own annual, seasonal, weekly and daily rhythm and, second, how contemporary scheduling strategies and tactics (compatibility, hammocking, etc.) can be identified in the monopolistic past, albeit interpreted along historically dominant PSB policy objectives.     

Using Survey Sites for Information Literacy Scheduling and Teaching

ABSTRACT

Active Information Literacy (IL) programs require scheduling management to ensure that librarians have adequate time to prepare, and that computers and classrooms are available. Collecting this information from busy faculty members can be time consuming. Internet survey sites can be used to collect the required information. These sites allow a library's IL staff to structure a questionnaire that elicits all of the information (instructor contact information, discipline, desired dates, times, number of students, and session topics) required to design instruction and schedule busy classrooms. doi:10.1300/J106v14n03_07     

A school-based feasibility study of method of levels: a novel form of client-led counselling

ABSTRACT

The purpose of this study was to test the feasibility and acceptability of a novel psychological therapy (Method of Levels) amongst adolescents experiencing psychological distress. An initial estimated effect size and a clinical significance analysis were undertaken which will help inform future studies. A case-series of 16 participants utilised the YP-CORE as a primary outcome measure. Data was collected at baseline, on completion of therapy (six months) and two and four months after completion of the therapy. Young people used a self-booking system to access sessions. Additionally, young people had full control over the content and length of the sessions. A total of 14 participants reported that the therapy was acceptable to them and 12 participants were retained for the entire course of the study. The self-booking system was successfully used with young people attending on average 6–8 sessions. Analysis of clinically significant change for the YP-CORE at therapy completion indicated that five students recovered and seven experienced no change; this was largely maintained at follow up. Effect size estimations were medium-to-large. Initial findings suggest that Method of Levels is a feasible and acceptable form of counselling for young people within the school setting. Moreover, positive preliminary effectiveness outcomes suggest that a randomised control study should be considered.     

正方教务管理系统在智能排课中的应用与思考

随着高校教学改革的深入,教务管理信息化已经成为高校教务管理改革和提高教务管理水平的主要途径。文章结合高校实际简述正方教务管理系统中智能排课的应用,从而实现教务管理的智能化、科学化、高效化。     

基于Hadoop平台的作业调度算法研究

爆炸式增长的数据要求高效率地使用计算资源,Hadoop是解决大数据处理的一个方向,不过Ha-doop平台还处于发展中,很多地方还有待完善。对Hadoop自带的三种调度器的优缺点进行分析,针对希望区分和动态改变作业服务质量的情况提出了动态优先调度算法。实验结果表明动态优先调度算法能够在作业的运行中动态改变作业的优先级,在效率上也有所提升。     

LTE系统中一种利用DRX降低UE功耗的视频流调度方法

提出一种利用DRX(discontinuous reception)降低UE(user equipment)功耗的视频流调度方法,该方法在保证数据包时延要求的同时,减少了InactivityTimer的开启次数,增加了UE的休眠时间. 仿真结果表明,相比已有的DRX机制下的实时业务调度方法,该方法可以在丢包率相同的情况下,显著降低UE的功耗.     

基于NSGA-Ⅱ算法的孤岛微电网优化调度

针对微电网微电源出力的不确定性,以孤岛微电网运行成本最低、风光消纳比例最大为目标函数,建立孤岛微电网多目标优化调度模型。依据微电网风光出力与负荷供需关系,提高孤岛微电网可再生能源消纳水平,并采用NSGA-Ⅱ算法对调度模型进行求解。以某地区微电网系统典型日为算例,以24小时为周期进行孤岛模式运行。算例结果表明,NSGA-Ⅱ算法调度方案可降低微电网整体成本,提高可再生能源的消纳能力,缓解孤岛微电网在峰谷期间的供电压力。     

课段式课程表的发展、经验及其启示

课段式课程表是美国学校最为常见的一种弹性课程表,也是颇具争议的一项中学教育改革实践,对美国课段式课程表的经验介绍能为我国课程在学校层面的管理和实施提供一个新的视角和经验借鉴.