期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
AN ANT COLONY ALGORITHM FOR YARD TRUCK SCHEDULING AND YARD LOCATION ASSIGNMENT PROBLEMS WITH PRECEDENCE CONSTRAINTS 被引量:8
1
作者 Zhaojie XUE Canrong ZHANG +1 位作者 Lixin MIAO Wei-Hua LIN 《Journal of Systems Science and Systems Engineering》 SCIE EI CSCD 2013年第1期21-37,共17页
This paper examines the yard truck scheduling,the yard location assignment for discharging containers,and the quay crane scheduling in container terminals.Taking into account the practical situation,we paid special at... This paper examines the yard truck scheduling,the yard location assignment for discharging containers,and the quay crane scheduling in container terminals.Taking into account the practical situation,we paid special attention to the loading and discharging precedence relationships between containers in the quay crane operations.A Mixed Integer Program(MIP) model is constructed,and a two-stage heuristic algorithm is proposed.In the first stage an Ant Colony Optimization(ACO) algorithm is employed to generate the yard location assignment for discharging containers.In the second stage,the integration of the yard truck scheduling and the quay crane scheduling is a flexible job shop problem,and an efficient greedy algorithm and a local search algorithm are proposed. Extensive numerical experiments are conducted to test the performance of the proposed algorithms. 展开更多
关键词 Container terminal yard truck scheduling yard location assignment quay crane scheduling precedence constraints ant colony optimization
原文传递
An O(n) Time Algorithm for Scheduling UET-UCT of Bipartite Digraphs of Depth One on Two Processors
2
作者 Ruzayn Quaddoura 《American Journal of Operations Research》 2016年第1期75-80,共6页
Given n unit execution time (UET) tasks whose precedence constraints form a directed acyclic graph, the arcs are associated with unit communication time (UCT) delays. The problem is to schedule the tasks on two identi... Given n unit execution time (UET) tasks whose precedence constraints form a directed acyclic graph, the arcs are associated with unit communication time (UCT) delays. The problem is to schedule the tasks on two identical processors in order to minimize the makespan. Several polynomial algorithms in the literature are proposed for special classes of digraphs, but the complexity of solving this problem in general case is still a challenging open question. We present in this paper an O(n) time algorithm to compute an optimal schedule for the class of bipartite digraphs of depth one. 展开更多
关键词 SCHEDULING MAKESPAN precedence constraints Bipartite Graph Optimal Algorithm
下载PDF
Modified Shifting Bottleneck Heuristic for Scheduling Problems of Large-Scale Job Shops
3
作者 ZHOU Bing-hai PENG Tao 《Journal of Donghua University(English Edition)》 EI CAS 2016年第6期883-887,共5页
A modified shifting bottleneck algorithm was proposed to solve scheduling problems of a large-scale job shop.Firstly,a new structured algorithm was employed for sub-problems so as to reduce the computational burden an... A modified shifting bottleneck algorithm was proposed to solve scheduling problems of a large-scale job shop.Firstly,a new structured algorithm was employed for sub-problems so as to reduce the computational burden and suit for large-scale instances more effectively.The modified cycle avoidance method,incorporating with the disjunctive graph model and topological sort algorithm,was applied to guaranteeing the feasibility of solutions with considering delayed precedence constraints.Finally,simulation experiments were carried out to verify the feasibility and effectiveness of the modified method.The results demonstrate that the proposed algorithm can solve the large-scale job shop scheduling problems(JSSPs) within a reasonable period of time and obtaining satisfactory solutions simultaneously. 展开更多
关键词 shifting bottleneck algorithm large-scale job shop scheduling disjunctive graph model delayed precedence constraint(DPC) cycle avoidance method
下载PDF
Concurrent processes scheduling with scarce resources in small and medium enterprises
4
作者 马嵩华 Tian Ling 《High Technology Letters》 EI CAS 2016年第3期273-281,共9页
Scarce resources,precedence and non-determined time-lag are three constraints commonly found in small and medium manufacturing enterprises(SMEs),which are deemed to block the application of workflow management system(... Scarce resources,precedence and non-determined time-lag are three constraints commonly found in small and medium manufacturing enterprises(SMEs),which are deemed to block the application of workflow management system(WfMS). To tackle this problem,a workflow scheduling approach is proposed based on timing workflow net(TWF-net) and genetic algorithm(GA). The workflow is modelled in a form of TWF-net in favour of process simulation and resource conflict checking. After simplifying and reconstructing the set of workflow instance,the conflict resolution problem is transformed into a resource-constrained project scheduling problem(RCPSP),which could be efficiently solved by a heuristic method,such as GA. Finally,problems of various sizes are utilized to test the performance of the proposed algorithm and to compare it with first-come-firstserved(FCFS) strategy. The evaluation demonstrates that the proposed method is an overwhelming and effective approach for scheduling the concurrent processes with precedence and resource constraints. 展开更多
关键词 concurrent processes scheduling resource constraint precedence constraint timing workflow net(TWF-net) genetic algorithm(GA)
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部