找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Complex Scheduling; Peter Brucker,Sigrid Knust Book 20061st edition Springer-Verlag Berlin Heidelberg 2006 Discrete Optimization.Job-Shop

[復(fù)制鏈接]
查看: 8925|回復(fù): 35
樓主
發(fā)表于 2025-3-21 17:27:43 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Complex Scheduling
編輯Peter Brucker,Sigrid Knust
視頻videohttp://file.papertrans.cn/232/231527/231527.mp4
概述Brucker has already written a successful book on scheduling.Presents many examples to illustrate the algorithms.Includes supplementary material:
叢書名稱GOR-Publications
圖書封面Titlebook: Complex Scheduling;  Peter Brucker,Sigrid Knust Book 20061st edition Springer-Verlag Berlin Heidelberg 2006 Discrete Optimization.Job-Shop
描述Scheduling problems have been investigated since the late ?fties. Two types of applications have mainly motivated research in this area: project planning and machine scheduling. While in machine scheduling a large number of speci?c scheduling situations depending on the machine environment and the job c- racteristicshavebeenconsidered, theearlyworkinprojectplanninginvestigated scheduling situations with precedence constraints between activities assuming that su?cient resources are available to perform the activities. More recently, in project scheduling scarce resources have been taken into account leading to so-called resource-constrained project scheduling problems. On the other hand, also in machine scheduling more general and complex problems have been - vestigated. Due to these developments today both areas are much closer to each other. Furthermore, applications like timetabling, rostering or industrial scheduling are connected to both areas. This book deals with such complex scheduling problems and methods to solve them. It consists of three parts: The ?rst part (Chapters 1 and 2) contains a description of basic scheduling models with applications and an introduction into di
出版日期Book 20061st edition
關(guān)鍵詞Discrete Optimization; Job-Shop Problems; Optimization Methods; Project Planning; Scheduling; algorithm; a
版次1
doihttps://doi.org/10.1007/3-540-29546-1
isbn_ebook978-3-540-29546-4
copyrightSpringer-Verlag Berlin Heidelberg 2006
The information of publication is updating

書目名稱Complex Scheduling影響因子(影響力)




書目名稱Complex Scheduling影響因子(影響力)學(xué)科排名




書目名稱Complex Scheduling網(wǎng)絡(luò)公開度




書目名稱Complex Scheduling網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Complex Scheduling被引頻次




書目名稱Complex Scheduling被引頻次學(xué)科排名




書目名稱Complex Scheduling年度引用




書目名稱Complex Scheduling年度引用學(xué)科排名




書目名稱Complex Scheduling讀者反饋




書目名稱Complex Scheduling讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 23:50:50 | 只看該作者
GOR-Publicationshttp://image.papertrans.cn/c/image/231527.jpg
板凳
發(fā)表于 2025-3-22 01:31:47 | 只看該作者
https://doi.org/10.1007/3-540-29546-1Discrete Optimization; Job-Shop Problems; Optimization Methods; Project Planning; Scheduling; algorithm; a
地板
發(fā)表于 2025-3-22 06:42:29 | 只看該作者
Springer-Verlag Berlin Heidelberg 2006
5#
發(fā)表于 2025-3-22 09:08:47 | 只看該作者
6#
發(fā)表于 2025-3-22 16:36:35 | 只看該作者
7#
發(fā)表于 2025-3-22 21:00:08 | 只看該作者
8#
發(fā)表于 2025-3-23 00:15:30 | 只看該作者
9#
發(fā)表于 2025-3-23 01:35:57 | 只看該作者
10#
發(fā)表于 2025-3-23 06:40:37 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-9 05:28
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
荥经县| 大英县| 会东县| 南陵县| 封丘县| 滦平县| 宁城县| 鹤山市| 阿拉善左旗| 阳新县| 玉山县| 云安县| 慈利县| 绥宁县| 雅江县| 齐齐哈尔市| 曲靖市| 齐河县| 禹城市| 高淳县| 五大连池市| 闸北区| 侯马市| 湛江市| 临沭县| 平度市| 昌图县| 台东市| 阳城县| 永靖县| 攀枝花市| 吉水县| 印江| 那坡县| 讷河市| 格尔木市| 社旗县| 华阴市| 原阳县| 普兰县| 屏东市|