检索结果-南通市图书馆

Scheduling problems on tardiness penalty and earliness award with simply linear processing time

在线全文

学校读者我要写书评

暂无评论

Journal of Shanghai University(English Edition) 2009年第2期13卷 123-128页

作者：余英卢圳孙世杰何龙敏胡晶地 Department of Mathematics College of SciencesShanghai UniversityShanghai 200444P.R.China Guangsha College of Applied Constraction Technology Dongyang 322100ZhejiangP.R.China

In this paper, a single-machine scheduling model with a given common due date and simple linear processing times was considered. The objective is the total weighted tardiness penalty and earliness award. Some polynomial time solvable cases for this problem are given. A dynamic programming algorithm was provided and a branch and bound algorithm for general case of the problem was provided based on a rapid method for estimating the lower bound.

关键词： scheduling single machine tardiness earliness

THE NP-HARDNESS OF THE SINGLE MACHINE COMMON DUE DATE WEIGHTED tardiness PROBLEM

在线全文

学校读者我要写书评

暂无评论

Systems Science and Mathematical Sciences 1992年第4期5卷 328-333页

作者： YUAN Jinjiang (Department of Mathematics,Zhengzhou University,Zhengzhou 450052,China)

In this paper we prove that the single machine common due dateweighted tardiness problem is NP-hard.

关键词： Due date tardiness NP-complete

THE SINGLE MACHINE STOCHASTIC SCHEDULING WITH THE WEIGHTED JOB tardiness MINIMIZATION

在线全文

学校读者我要写书评

暂无评论

Systems Science and Systems Engineering 2004年第3期13卷 342-347页

作者： DequanYUE FengshengTU CollegeofSciencesYanshanUniversity Qinhuangdao066004P.R.China CollegeoflnformationTechnicalScienceNankaiUniversity Tianjin300071P.R.China

This paper considers scheduling n jobs on a single machine where the job processing times anddue dates are independent random variables with arbitrary distribution *** consider the casethat the weighted job tardiness in expectation is *** is assumed that job's due dates arecompatible with processing times and *** show that the jobs should be sequenced indecreasing stochastic order of their due dates.

关键词： Stochastic scheduling stochastic order tardiness

No-Wait Flowshops to Minimize Total tardiness with Setup Times

在线全文

学校读者我要写书评

暂无评论

Intelligent Control and Automation 2015年第1期6卷 38-44页

作者： Tariq Aldowaisan Ali Allahverdi Department of Industrial and Management Systems Engineering Kuwait University Kuwait City Kuwait

The m-machine no-wait flowshop scheduling problem is addressed where setup times are treated as separate from processing times. The objective is to minimize total tardiness. Different dispatching rules have been investigated and three were found to be superior. Two heuristics, a simulated annealing (SA) and a genetic algorithm (GA), have been proposed by using the best performing dispatching rule as the initial solution for SA, and the three superior dispatching rules as part of the initial population for GA. Moreover, improved versions of SA and GA are proposed using an insertion algorithm. Extensive computational experiments reveal that the improved versions of SA and GA perform about 95% better than SA and GA. The improved version of GA outperforms the improved version of SA by about 3.5%.

关键词： No-Wait Flowshop Scheduling Setup Times Total tardiness Simulated Annealing Genetic Algorithm

An Iterated Greedy Algorithm for Distributed Flowshop Group Scheduling Problem with Total tardiness Criterion

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

An Iterated Greedy Algorithm for Distributed Flowshop Group ...

A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time

第40届中国控制会议

作者： Zhi-Yuan Wang Cheng-Min Yu Quan-Ke Pan Yuan-Zhen Li School of Mechanical and Electrical Engineering and Automation Shanghai University School of Computer Science Liaocheng University

In recent years, the distributed permutation flowshop group scheduling problem（DPFGSP） has become an increasingly active research field. This paper deals with the distributed permutation flowshop group scheduling problem（DPFGSP） to minimize the total tardiness. The problem that the paper has considered is an extension of the traditional flowshop scheduling problem（FSP）, in which all jobs are grouped into groups by nature and the decision is included for every group to select the best factory to ensure the smallest total tardiness. For the specific problem, we propose an iterated greedy（IG）algorithm to solve our problem. We carry out a lot of computational evaluations for the algorithm the paper proposing based on the 405 instances. Lastly, the effectiveness of the proposed algorithm for solve the DPFGSP with total tardiness criterion is finally proved.

关键词： flow-shop distributed group scheduling tardiness IG

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Shanghai University(English Edition) 2008年第3期12卷 204-209页

作者：余英孙世杰何龙敏 Department of Mathematics College of Sciences Shanghai University Shanghai 200444 P. R. China

In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total weighted earliness award and tardiness penalty. Our aim is to find an optimal schedule so as to minimize the objective function. As the problem is NP-hard, some properties and polynomial time solvable cases of this problem are given. A dynamic programming algorithm for the general case of the problem is provided.

关键词： scheduling single-machine linear decreasing processing time earliness tardiness

Robust single machine scheduling problem with uncertain job due dates for industrial mass production

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2020年第2期31卷 350-358页

作者： YUE Fan SONG Shiji JIA Peng WU Guangping ZHAO Han Department of Automation Tsinghua UniversityBeijing 100084China Research Institute of Systems Engineering Beijing 100072China Jiuquan Satellite Launch Centre Jiuquan 735000China Department of Basic Science Army Logistics AcademyChongqing 401311China

The single machine scheduling problem which involves uncertain job due dates is one of the most important issues in the real make-to-order environment. To deal with the uncertainty, this paper establishes a robust optimization model by minimizing the maximum tardiness in the worst case scenario over all jobs. Unlike the traditional stochastic programming model which requires exact distributions, our model only needs the information of due date intervals. The worst case scenario for a given sequence that belongs to a set containing only n scenarios is proved, where n is the number of jobs. Then, the model is simplified and reformulated as an equivalent mixed 0-1 integer linear programming(MILP) problem. To solve the MILP problems efficiently, a heuristic approach is proposed based on a robust dominance rule. The experimental results show that the proposed method has the advantages of robustness and high calculating efficiency, and it is feasible for large-scale problems.

关键词： robust optimization single machine scheduling maximum tardiness uncertain due date

Minmax Common Due-Window Assignment Scheduling with Deteriorating Jobs

在线全文

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2024年第3期12卷 681-693页

作者： Dan-Yang Lv Jing Xue Ji-Bo Wang School of Mechatronics Engineering Shenyang Aerospace UniversityShenyang110136LiaoningChina

This paper investigates the common due-window assignment scheduling problem with deteriorating jobs on a single machine in which the processing time of a job is a proportional function of its starting *** goal is to minimize the maximum value of earliness and tardiness penalties,as well as due-window location cost,and size *** on whether the location and size of due-window are known,this paper studies three relevant cases,all of which are solvable in polynomial time.

关键词： Scheduling Single machine Deteriorating jobs Common due-window Earliness tardiness

Modified NSGA-II for a Bi-Objective Job Sequencing Problem

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Intelligent Information Management 2012年第6期4卷 319-329页

作者： Susmita Bandyopadhyay Department of Production Engineering Jadavpur University Kolkata India

This paper proposes a better modified version of a well-known Multi-Objective Evolutionary Algorithm (MOEA) known as Non-dominated Sorting Genetic Algorithm-II (NSGA-II). The proposed algorithm contains a new mutation algorithm and has been applied on a bi-objective job sequencing problem. The objectives are the minimization of total weighted tardiness and the minimization of the deterioration cost. The results of the proposed algorithm have been compared with those of original NSGA-II. The comparison of the results shows that the modified NSGA-II performs better than the original NSGA-II.

关键词： Job Sequencing Multi-Objective Evolutionary Algorithm (MOEA) NSGA-II (Non-Dominated Sorting Genetic Algorithm-II) tardiness Deterioration Cost