检索结果-南通市图书馆

A heuristic algorithm.for the Two-Machine Flowshop Group Scheduling Problem

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2002年第4期13卷 8-16页

作者： Wang Xiuli & Wu Tihua Department of Automation, Shanghai Jiaotong University, Shanghai 200030, P.R. China Department of Automation Shanghai Jiaotong University Shanghai 200030 P. R. China

This paper presents the two-machine flowshop group scheduling problem with the optimal objective of maximum lateness. A dominance rule within group and a dominance rule between groups are established. These dominance rules along with a previously established dominance rule are used to develop a heuristic algorithm. Experimental results are given and analyzed.

关键词： Group scheduling Flowshop heuristic algorithm.

同方期刊数据库

MULTITASK n-VEHICLE EXPLORATION PROBLEM:COMPLEXITY AND algorithm

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2012年第6期25卷 1080-1092页

作者： Yangyang XU Jinchuan CUI Institute of Applied Mathematics Academy of Mathematics and Systems ScienceChinese Academy of Sciences

This paper extends the single-task n-Vehicle Exploration Problem to Multitask n-Vehicle Exploration Problem （MTNVEP）, by combining n-Vehicle Exploration Problem with Job Scheduling Problem. At first, the authors prove that MTNVEP is NP-hard for fixed number of tasks, and it is strongly NP-hard for general number of tasks. Then they propose an improved accurate algorithm.with computing time O（n3n）, which is better than O（n!） as n becomes sufficiently large. Moreover, four heuristic algorithm. are proposed. Effectiveness of the heuristic algorithm. is illustrated by experiments at last.

关键词： Multitask n-Vehicle Exploration Problem (MTNVEP) NP-hard strongly NP-hard heuristic algorithm.

Stochastic programming approach for earthquake disaster relief mobilization with multiple objectives

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2013年第4期24卷 642-654页

作者： Yajie Liu Tao Zhang Hongtao Lei Bo Guo College of Information Systems and Management National University of Defense Technology

The goal of this research is to develop an emergency disaster relief mobilization tool that determines the mobilization levels of commodities, medical service and helicopters （which will be utilized as the primary means of transport in a mountain region struck by a devastating earthquake） at pointed temporary facilities, including helicopter-based delivery plans for commodities and evacuation plans for critical population, in which relief demands are considered as uncertain. The proposed mobilization model is a two-stage stochastic mixed integer program with two objectives： maximizing the expected fill rate and minimizing the total expenditure of the mobilization campaign. Scenario decomposition based heuristic algorithm. are also developed according to the structure of the proposed model. The computational results of a numerical example, which is constructed from the scenarios of the Great Wenchuan Earthquake, indicate that the model can provide valuable decision support for the mobilization of post-earthquake relief, and the proposed algorithm. also have high efficiency in computation.

关键词： relief mobilization stochastic optimization model scenarios decomposition heuristic algorithm.

Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage

在线全文

学校读者我要写书评

暂无评论

Applied Mathematics(A Journal of Chinese Universities) 2013年第3期28卷 358-368页

作者： DONG Jian-ming HU Jue-liang CHEN Yong Department of Mathematics Zhejiang Sci-Tech University Institute of Operational Research and Cybernetics Hangzhou Dianzi University

This paper considers a scheduling problem in two-stage hybrid flow shop, where the first stage consists of two machines formed an open shop and the other stage has only one machine. The objective is to minimize the makespan, i.e., the maximum completion time of all jobs. We first show the problem is NP-hard in the strong sense, then we present two heuristics to solve the problem. Computational experiments show that the combined algorithm.of the two heuristics performs well on randomly generated problem instances.

关键词： hybrid flow shop open shop heuristic algorithm.

Rolling optimization algorithm.based on collision window for single machine scheduling problem

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2005年第4期16卷 816-822页

作者： Wang Changjun Xi Yugeng Dept. of Automation Shanghai Jiaotong Univ. Shanghai 200030 P. R. China

Focusing on the single machine scheduling problem which minimizes the total completion time in the presence of dynamic job arrivals, a rolling optimization scheduling algorithm.is proposed based on the analysis of the character and structure of scheduling. An optimal scheduling strategy in collision window is presented. Performance evaluation of this algorithm.is given. Simulation indicates that the proposed algorithm.is better than other common heuristic algorithm. on both the total performance and stability.

关键词： single machine scheduling rolling scheduling performance analysis heuristic algorithm.

Model and algorithm.for optimization of rescue center location of emergent catastrophe

在线全文

学校读者我要写书评

暂无评论

Frontiers of Electrical and Electronic Engineering in China 2006年第3期1卷 265-268页

作者： WANG Ding-wei ZHANG Guo-xiang Institute of Systems Engineering Northeastern UniversityShenyang 110004China

The location of rescue centers is a key problem in optimal resource allocation and logistics in emergency *** propose a mathematical model for rescue center location with the considerations of emergency oc-currence probability,catastrophe diffusion function and rescue *** the catastrophe diffusion and res-cue functions are both nonlinear and time-variable,it cannot be solved by common mathematical programming *** develop a heuristic embedded genetic algorithm.for the special model *** computation based on a large number of examples with practical data has shown us satis-factory results.

关键词： emergent event emergency response location optimization genetic algorithm heuristic algorithm.