找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Handbook on Scheduling; From Theory to Pract Jacek Blazewicz,Klaus H. Ecker,Jan Weglarz Book 2019Latest edition Springer Nature Switzerland

[复制链接]
楼主: 分期
发表于 2025-3-23 12:50:09 | 显示全部楼层
Scheduling in Hard Real-Time Systems,In Chapters 4 and 5 we analyzed scheduling problems in which the task performance is subject to temporal restrictions such as release times or deadlines.
发表于 2025-3-23 14:32:08 | 显示全部楼层
发表于 2025-3-23 18:18:43 | 显示全部楼层
Open Shop Scheduling,The formulation of an open shop scheduling problem is the same as for the flow shop problem except that the order of processing tasks comprising one job may be arbitrary.
发表于 2025-3-24 01:40:14 | 显示全部楼层
发表于 2025-3-24 02:32:28 | 显示全部楼层
发表于 2025-3-24 09:29:38 | 显示全部楼层
Time-Dependent Scheduling,In previous chapters we have always assumed that the processing times of tasks are . and described by numbers.
发表于 2025-3-24 10:56:03 | 显示全部楼层
Scheduling under Resource Constraints,The scheduling model we consider now is more complicated than the previous ones, because any task, besides processors, may require for its processing some additional scarce resources.
发表于 2025-3-24 16:41:01 | 显示全部楼层
Scheduling Imprecise Computations,The previous chapters focused on various scheduling models, such as single or parallel processors (Chapters 4, 5) and shop systems (Chapters 8, 9, 10), and presented results for different performance measures.
发表于 2025-3-24 22:04:57 | 显示全部楼层
发表于 2025-3-25 01:25:10 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-17 12:56
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表