《2016 Development and analysis of cost-based dispatching rules for job shop scheduling》.pdf
- 1、本文档共15页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
《2016 Development and analysis of cost-based dispatching rules for job shop scheduling》.pdf
European Journal of Operational Research 157 (2004) 307–321
/locate/dsw
Discrete Optimization
Development and analysis of cost-based
dispatching rules for job shop scheduling
M.S. Jayamohan, Chandrasekharan Rajendran *
Industrial Engineering and Management Division, Department of Humanities and Social Sciences,
Indian Institute of Technology Madras, Chennai 600 036, India
Received 7 September 2000; accepted 21 January 2003
Abstract
Most dispatching rules for job shop scheduling assume that the cost of holding per unit time is the same for all jobs.
Likewise, it is assumed that the cost of tardiness per unit time is the same for all jobs. In other words, it is implied that
the holding cost of a job is directly proportional to its flowtime, and the tardiness cost of a job is directly proportional
to its positive lateness. These assumptions may not hold good in all situations. Some attempts were made to overcome
this deficiency, and a couple of dispatching rules were proposed by considering different weights or penalties for dif-
ferent jobs. However, these dispatching rules assume that the holding and tardiness costs per unit time of a given job are
the same, even though these costs may differ from job to job in practice. In this study, we propose dispatching rules by
explicitly considering different weights or penalties for flowtime and tardiness of a job. Many measures of performance
related to weighted flowtime and weighted tardiness of jobs are considered, and the results of simulation are presented.
2003 Elsevier B.V. All rights reserved.
Keywords: Job shop; Scheduling; Weighted flowtime; Weigh
您可能关注的文档
- 《1991 A branch and bound algorithm for job-shop scheduling》.pdf
- 《1992 An integrated model for job-shop planning and scheduling》.pdf
- 《1993 A practical approach to job-shop scheduling problems》.pdf
- 《1993 An efficient dynamic dispatching rule for scheduling in a job shop》.pdf
- 《1994 A branch and bound algorithm for the job-shop scheduling problem》.pdf
- 《1994 Adjustments of heads and tails for the job-shop problem》.pdf
- 《1994 The job-shop problem and immediate selection》.pdf
- 《1995 A descent proximal level bundle method for convex nondifferentiable optimization》.pdf
- 《1995 A more efficient Lagrangian relaxation approach to job-shop scheduling problems》.pdf
- 《1995 A reinforcement Learning approach to job-shop scheduling》.pdf
文档评论(0)