找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Models and Algorithms of Time-Dependent Scheduling; Stanis?aw Gawiejnowicz Book 2020Latest edition Springer-Verlag GmbH Germany, part of S

[復(fù)制鏈接]
查看: 27029|回復(fù): 35
樓主
發(fā)表于 2025-3-21 17:48:59 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Models and Algorithms of Time-Dependent Scheduling
編輯Stanis?aw Gawiejnowicz
視頻videohttp://file.papertrans.cn/637/636737/636737.mp4
概述Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started.Author includes numerous examples, figures and tables, and different classes of
叢書名稱Monographs in Theoretical Computer Science. An EATCS Series
圖書封面Titlebook: Models and Algorithms of Time-Dependent Scheduling;  Stanis?aw Gawiejnowicz Book 2020Latest edition Springer-Verlag GmbH Germany, part of S
描述This is a comprehensive study of various time-dependent scheduling problems in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics such as matrix methods in time-dependent scheduling, time-dependent scheduling with two criteria and time-dependent two-agent scheduling..The reader should be familiar with the basic notions of calculus, discrete mathematics and combinatorial optimization theory, while the book offers introductory material on theory of algorithms, NP-complete problems, and the basics of scheduling theory. The author includes numerous examples, figures and tables, he presents different classes of algorithms using pseudocode, he completes all chapters with extensive bibliographies, and he closes the book with comprehensive symbol and subject indexes..The previous edition ofthe book focused on computational complexity of time-dependent scheduling problems. In this edition, the author concentrates on models of time-dependent job processing times and algorithms for solving time-dependent scheduling problems. Th
出版日期Book 2020Latest edition
關(guān)鍵詞Optimization Theory; Algorithms; Combinatorial Optimization; Heuristics; Scheduling; Time-Dependent Sched
版次2
doihttps://doi.org/10.1007/978-3-662-59362-2
isbn_softcover978-3-662-59364-6
isbn_ebook978-3-662-59362-2Series ISSN 1431-2654 Series E-ISSN 2193-2069
issn_series 1431-2654
copyrightSpringer-Verlag GmbH Germany, part of Springer Nature 2020
The information of publication is updating

書目名稱Models and Algorithms of Time-Dependent Scheduling影響因子(影響力)




書目名稱Models and Algorithms of Time-Dependent Scheduling影響因子(影響力)學(xué)科排名




書目名稱Models and Algorithms of Time-Dependent Scheduling網(wǎng)絡(luò)公開度




書目名稱Models and Algorithms of Time-Dependent Scheduling網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Models and Algorithms of Time-Dependent Scheduling被引頻次




書目名稱Models and Algorithms of Time-Dependent Scheduling被引頻次學(xué)科排名




書目名稱Models and Algorithms of Time-Dependent Scheduling年度引用




書目名稱Models and Algorithms of Time-Dependent Scheduling年度引用學(xué)科排名




書目名稱Models and Algorithms of Time-Dependent Scheduling讀者反饋




書目名稱Models and Algorithms of Time-Dependent Scheduling讀者反饋學(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

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:16:18 | 只看該作者
板凳
發(fā)表于 2025-3-22 04:23:26 | 只看該作者
1431-2654 onal complexity of time-dependent scheduling problems. In this edition, the author concentrates on models of time-dependent job processing times and algorithms for solving time-dependent scheduling problems. Th978-3-662-59364-6978-3-662-59362-2Series ISSN 1431-2654 Series E-ISSN 2193-2069
地板
發(fā)表于 2025-3-22 08:27:50 | 只看該作者
Book 2020Latest editionrehensive symbol and subject indexes..The previous edition ofthe book focused on computational complexity of time-dependent scheduling problems. In this edition, the author concentrates on models of time-dependent job processing times and algorithms for solving time-dependent scheduling problems. Th
5#
發(fā)表于 2025-3-22 11:38:17 | 只看該作者
Models and Algorithms of Time-Dependent Scheduling
6#
發(fā)表于 2025-3-22 15:41:01 | 只看該作者
7#
發(fā)表于 2025-3-22 20:20:13 | 只看該作者
Monographs in Theoretical Computer Science. An EATCS Serieshttp://image.papertrans.cn/m/image/636737.jpg
8#
發(fā)表于 2025-3-22 22:46:49 | 只看該作者
9#
發(fā)表于 2025-3-23 04:41:23 | 只看該作者
10#
發(fā)表于 2025-3-23 08:06:12 | 只看該作者
Models and Algorithms of Time-Dependent Scheduling978-3-662-59362-2Series ISSN 1431-2654 Series E-ISSN 2193-2069
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-24 20:47
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
新宁县| 克山县| 嘉善县| 本溪| 宁强县| 囊谦县| 岗巴县| 白水县| 稻城县| 阳高县| 柳州市| 台湾省| 廊坊市| 安化县| 邵阳市| 抚顺县| 云浮市| 侯马市| 东台市| 南木林县| 体育| 孝义市| 河北区| 河北省| 宝丰县| 溧水县| 克什克腾旗| 林甸县| 大洼县| 连云港市| 泰来县| 剑川县| 且末县| 鹿邑县| 邳州市| 阿合奇县| 板桥市| 炉霍县| 杨浦区| 湄潭县| 资溪县|