找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 24598|回復(fù): 54
樓主
發(fā)表于 2025-3-21 18:28:44 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling
編輯Ghaith Rabadi
視頻videohttp://file.papertrans.cn/427/426057/426057.mp4
概述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
關(guān)鍵詞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影響因子(影響力)學(xué)科排名




書目名稱Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling網(wǎng)絡(luò)公開度




書目名稱Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling被引頻次




書目名稱Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling被引頻次學(xué)科排名




書目名稱Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling年度引用




書目名稱Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling年度引用學(xué)科排名




書目名稱Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling讀者反饋




書目名稱Heuristics, Metaheuristics and Approximate Methods in Planning and 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 20:24:31 | 只看該作者
板凳
發(fā)表于 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
地板
發(fā)表于 2025-3-22 06:43:26 | 只看該作者
5#
發(fā)表于 2025-3-22 09:31:31 | 只看該作者
6#
發(fā)表于 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
7#
發(fā)表于 2025-3-22 17:22:42 | 只看該作者
8#
發(fā)表于 2025-3-23 00:44:33 | 只看該作者
9#
發(fā)表于 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
10#
發(fā)表于 2025-3-23 05:45:05 | 只看該作者
 關(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-11 17:30
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
苗栗市| 岳西县| 越西县| 信丰县| 东海县| 西安市| 泗阳县| 和林格尔县| 巴林左旗| 乌鲁木齐市| 永州市| 丰宁| 赤城县| 邹平县| 东阿县| 岑溪市| 南川市| 黔西| 乐东| 咸阳市| 武平县| 年辖:市辖区| 广丰县| 福州市| 内丘县| 泊头市| 平罗县| 广丰县| 金塔县| 沾化县| 巩留县| 宁津县| 阿克苏市| 内乡县| 咸阳市| 张掖市| 福建省| 鹰潭市| 达日县| 军事| 桦南县|