.png){kind=icon}
返回
Batch loading and scheduling problem with processing time deterioration and rate-modifying activities
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2020.1866783.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This research addresses a single machine batch loading and scheduling problem. Jobs in the same family are processed as a batch in the machine with a known family-specific processing time. Each job in a batch requires a known volume or space, and the total batch volume cannot exceed the available volume/capacity of the machine. Batch processing times increase proportionately with the time since the most recent rate-modifying activity and the starting time of a batch. A rate-modifying activity can be executed which restores original batch processing times. In this research, a solution procedure is proposed that simultaneously determines the appropriate batching of jobs and the number of rate-modifying activities. Job batches and the rate-modifying activities are then sequenced to minimise the makespan. To develop a solution procedure, a mixed integer linear programming model is formulated and a tight lower bound is proposed. Three genetic algorithms (GAs), including batch loading and sequencing heuristics, are proposed. The performance of the three GAs is compared, and the best GA is compared to other meta-heuristic algorithms.
Keyword:
Scheduling
genetic algorithm
mixed linear integer programming
deteriorations
rate-modifying activity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine在单台机器上调度带有CON/SLK到期日期分配的恶化作业
PREAI
分享收藏
查看更多内容