用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling; Ghaith Rabadi Book 2016 Springer International Publishing S

[复制链接]
查看: 24540|回复: 54
发表于 2025-3-21 18:28:44 | 显示全部楼层 |阅读模式
书目名称Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling
编辑Ghaith Rabadi
视频video
概述First book to examine developments in the use of heuristics in scheduling problems since 1993.Considers problems in manufacturing, services, and healthcare.Contributors include some of the most promin
丛书名称International Series in Operations Research & Management Science
图书封面Titlebook: Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling;  Ghaith Rabadi Book 2016 Springer International Publishing S
描述.The scope of this book is limited to heuristics, metaheuristics, and approximate methods and algorithms as applied to planning and scheduling problems. While it is not possible to give a comprehensive treatment of this topic in one book, the aim of this work is to provide the reader with a diverse set of planning and scheduling problems and different heuristic approaches to solve them. The problems range from traditional single stage and parallel machine problems to more modern settings such as robotic cells and flexible job shop networks. Furthermore, some chapters deal with deterministic problems while some others treat stochastic versions of the problems. Unlike most of the literature that deals with planning and scheduling problems in the manufacturing and production environments, in this book the environments were extended to nontraditional applications such as spatial scheduling (optimizing space over time), runway scheduling, and surgical scheduling. The solution methods usedin the different chapters of the book also spread from well-established heuristics and metaheuristics such as Genetic Algorithms and Ant Colony Optimization to more recent ones such as Meta-RaPS...
出版日期Book 2016
关键词Ant Colony Optimization; Approximate Methods; Batch Processing Machines; Heuristics; Manufacturing Opera
版次1
doihttps://doi.org/10.1007/978-3-319-26024-2
isbn_softcover978-3-319-79878-3
isbn_ebook978-3-319-26024-2Series ISSN 0884-8289 Series E-ISSN 2214-7934
issn_series 0884-8289
copyrightSpringer International Publishing Switzerland 2016
The information of publication is updating

书目名称Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling影响因子(影响力)




书目名称Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling影响因子(影响力)学科排名




书目名称Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling网络公开度




书目名称Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling网络公开度学科排名




书目名称Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling被引频次




书目名称Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling被引频次学科排名




书目名称Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling年度引用




书目名称Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling年度引用学科排名




书目名称Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling读者反馈




书目名称Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling读者反馈学科排名




单选投票, 共有 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

您所在的用户组没有投票权限
发表于 2025-3-21 20:24:31 | 显示全部楼层
发表于 2025-3-22 01:13:29 | 显示全部楼层
Stochastic Scheduling for a Network of Flexible Job Shops,imizing the sum of completion times and the cost incurred, assuming stochastic job processing times. This problem is of particular interest for the production control in high investment, low volume manufacturing environments, such as pilot-fabrication of microelectromechanical systems (MEMS) devices
发表于 2025-3-22 06:43:26 | 显示全部楼层
发表于 2025-3-22 09:31:31 | 显示全部楼层
发表于 2025-3-22 15:24:49 | 显示全部楼层
Meta-RaPS for a Bi-objective Unrelated Parallel Machine Scheduling Problem,i-objective problem of unrelated parallel machine scheduling is considered in the chapter. The two objectives to minimize are total weighted tardiness and total weighted completion time. An existing construction rule in the literature named Apparent Tardiness Cost-bi heuristic is used as the basis f
发表于 2025-3-22 17:22:42 | 显示全部楼层
发表于 2025-3-23 00:44:33 | 显示全部楼层
发表于 2025-3-23 02:22:07 | 显示全部楼层
Metaheuristic Approaches for Scheduling Jobs on Parallel Batch Processing Machines,a single machine. The jobs belong to incompatible job families. Only jobs of the same family can be batched together. We are interested in minimizing the total weighted tardiness (TWT) of the jobs. Problems of this type arise, for instance, in semiconductor manufacturing. Other known occurrence of b
发表于 2025-3-23 05:45:05 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-22 16:53
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表