首页   按字顺浏览 期刊浏览 卷期浏览 Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical ...
Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines

 

作者: AlidaeeBahram,   PanwalkarS. S.,  

 

期刊: Journal of the Operational Research Society  （Taylor Available online 1993）
卷期: Volume 44, issue 1  

页码: 29-36

 

ISSN:0160-5682

 

年代: 1993

 

DOI:10.1057/jors.1993.4

 

出版商: Taylor&Francis

 

关键词: Minimum Absolute Lateness Problem;Due Date Minimization;Transportation Problem;Heuristics;Scheduling

 

数据来源: Taylor

 

摘要:

AbstractIn this paper we consider schedulingnsingle operation jobs with a common due date onmnon-identical machines (in parallel) so as to minimize the sum of the absolute lateness. We reduce the problem to a transportation problem that can be solved by a polynomial time algorithm. Furthermore, we consider the problem in the case of identical machines and we give a heuristic algorithm to minimize makespan among all schedules that minimize the absolute lateness problem.

 

点击下载:  PDF (3745KB)



返 回