找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 50630|回復(fù): 52
樓主
發(fā)表于 2025-3-21 17:30:21 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱Metaheuristics for Scheduling in Industrial and Manufacturing Applications
編輯Fatos Xhafa,Ajith Abraham
視頻videohttp://file.papertrans.cn/632/631377/631377.mp4
概述First book on scheduling problems in Grid, P2P and other Emergent Computational Systems.Includes supplementary material:
叢書(shū)名稱Studies in Computational Intelligence
圖書(shū)封面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
關(guān)鍵詞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

書(shū)目名稱Metaheuristics for Scheduling in Industrial and Manufacturing Applications影響因子(影響力)




書(shū)目名稱Metaheuristics for Scheduling in Industrial and Manufacturing Applications影響因子(影響力)學(xué)科排名




書(shū)目名稱Metaheuristics for Scheduling in Industrial and Manufacturing Applications網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Metaheuristics for Scheduling in Industrial and Manufacturing Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Metaheuristics for Scheduling in Industrial and Manufacturing Applications被引頻次




書(shū)目名稱Metaheuristics for Scheduling in Industrial and Manufacturing Applications被引頻次學(xué)科排名




書(shū)目名稱Metaheuristics for Scheduling in Industrial and Manufacturing Applications年度引用




書(shū)目名稱Metaheuristics for Scheduling in Industrial and Manufacturing Applications年度引用學(xué)科排名




書(shū)目名稱Metaheuristics for Scheduling in Industrial and Manufacturing Applications讀者反饋




書(shū)目名稱Metaheuristics for Scheduling in Industrial and Manufacturing Applications讀者反饋學(xué)科排名




單選投票, 共有 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

您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:50:54 | 只看該作者
板凳
發(fā)表于 2025-3-22 03:20:42 | 只看該作者
地板
發(fā)表于 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.
5#
發(fā)表于 2025-3-22 12:46:57 | 只看該作者
6#
發(fā)表于 2025-3-22 15:04:50 | 只看該作者
7#
發(fā)表于 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.
8#
發(fā)表于 2025-3-22 23:48:31 | 只看該作者
9#
發(fā)表于 2025-3-23 03:13:17 | 只看該作者
10#
發(fā)表于 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.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-5 15:12
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
延津县| 金沙县| 鄢陵县| 义乌市| 静海县| 兰考县| 德惠市| 九龙坡区| 鄄城县| 原平市| 金川县| 郧西县| 阿勒泰市| 泾阳县| 抚远县| 博罗县| 沙河市| 惠来县| 咸阳市| 黄骅市| 内乡县| 治多县| 万荣县| 昌黎县| 林甸县| 宁海县| 夏津县| 铜鼓县| 桑日县| 白银市| 金湖县| 繁峙县| 运城市| 台东市| 元朗区| 秦安县| 宽城| 洛扎县| 武汉市| 保康县| 衡阳市|