找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Metaheuristics for Scheduling in Industrial and Manufacturing Applications; Fatos Xhafa,Ajith Abraham Book 2008 Springer-Verlag Berlin Hei

[复制链接]
查看: 50464|回复: 52
发表于 2025-3-21 17:30:21 | 显示全部楼层 |阅读模式
书目名称Metaheuristics for Scheduling in Industrial and Manufacturing Applications
编辑Fatos Xhafa,Ajith Abraham
视频video
概述First book on scheduling problems in Grid, P2P and other Emergent Computational Systems.Includes supplementary material:
丛书名称Studies in Computational Intelligence
图书封面Titlebook: Metaheuristics for Scheduling in Industrial and Manufacturing Applications;  Fatos Xhafa,Ajith Abraham Book 2008 Springer-Verlag Berlin Hei
描述During the past decades scheduling has been among the most studied op- mization problemsanditisstillanactiveareaofresearch!Schedulingappears in many areas of science, engineering and industry and takes di?erent forms depending on the restrictions and optimization criteria of the operating en- ronments [8]. For instance, in optimization and computer science, scheduling has been de?ned as “the allocation of tasks to resources over time in order to achieve optimality in one or more objective criteria in an e?cient way” and in production as “production schedule, i. e. , the planning of the production or the sequence of operations according to which jobs pass through machines and is optimal with respect to certain optimization criteria. ” Although there is a standardized form of stating any scheduling problem, namely “e?cient allocation ofn jobs onm machines –which can process no more than one activity at a time– with the objective to optimize some - jective function of the job completion times”, scheduling is in fact a family of problems. Indeed, several parameters intervene in the problem de?nition: (a) job characteristics (preemptive or not, precedence constraints, release dates, etc
出版日期Book 2008
关键词Lot sizing and Manufacturing systems; Meta-Heuristics; Multiprocessor scheduling; Production Scheduling
版次1
doihttps://doi.org/10.1007/978-3-540-78985-7
isbn_softcover978-3-642-09778-2
isbn_ebook978-3-540-78985-7Series ISSN 1860-949X Series E-ISSN 1860-9503
issn_series 1860-949X
copyrightSpringer-Verlag Berlin Heidelberg 2008
The information of publication is updating

书目名称Metaheuristics for Scheduling in Industrial and Manufacturing Applications影响因子(影响力)




书目名称Metaheuristics for Scheduling in Industrial and Manufacturing Applications影响因子(影响力)学科排名




书目名称Metaheuristics for Scheduling in Industrial and Manufacturing Applications网络公开度




书目名称Metaheuristics for Scheduling in Industrial and Manufacturing Applications网络公开度学科排名




书目名称Metaheuristics for Scheduling in Industrial and Manufacturing Applications被引频次




书目名称Metaheuristics for Scheduling in Industrial and Manufacturing Applications被引频次学科排名




书目名称Metaheuristics for Scheduling in Industrial and Manufacturing Applications年度引用




书目名称Metaheuristics for Scheduling in Industrial and Manufacturing Applications年度引用学科排名




书目名称Metaheuristics for Scheduling in Industrial and Manufacturing Applications读者反馈




书目名称Metaheuristics for Scheduling in Industrial and Manufacturing Applications读者反馈学科排名




单选投票, 共有 1 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:50:54 | 显示全部楼层
发表于 2025-3-22 03:20:42 | 显示全部楼层
发表于 2025-3-22 05:27:51 | 显示全部楼层
Heuristics and meta-heuristics for lot sizing and scheduling in the soft drinks industry: a compariso far are surveyed and conceptually compared. Two different approaches have been selected to perform a series of computational comparisons: an evolutionary technique comprising a genetic algorithm and its memetic version, and a decomposition and relaxation approach.
发表于 2025-3-22 12:46:57 | 显示全部楼层
发表于 2025-3-22 15:04:50 | 显示全部楼层
发表于 2025-3-22 20:05:38 | 显示全部楼层
Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems,ults obtained through Scatter Search. We present insights in the development of this heuristic technique, and discuss the combinatorial difficulties of the problems through the analysis of extensive computational results.
发表于 2025-3-22 23:48:31 | 显示全部楼层
发表于 2025-3-23 03:13:17 | 显示全部楼层
发表于 2025-3-23 07:17:48 | 显示全部楼层
Solving Scheduling Problems by Evolutionary Algorithms for Graph Coloring Problem,he performance of the proposed algorithm is verified by computer experiments on the set of benchmark graphs instances (DIMACS). Additional experiments were done on benchmark graph for timetabling problem.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-1 22:10
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表