.png){kind=icon}
Return
Solving single batch-processing machine problems using an iterated heuristic
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2010.518995.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article considers the problem of minimising total weighted tardiness on a batch-processing machine with compatible product families, job release dates and non-identical job sizes. A batch-processing machine can process several jobs as long as the total size of jobs in the batch does not exceed the machine's capacity. All jobs in the batch are started and completed at the same time. Batch processing time is equal to the longest job processing time among jobs in the batch. This article proposes a two-phase heuristic, in which a population-based reasoning approach is developed to determine the sequence of jobs based on their intensity values at positions in the first phase, and a dynamic programming algorithm to divide the ordered jobs into batches sequentially. An iterated heuristic is also proposed to improve solution quality further. Computational results show that high-quality solutions can be obtained by the proposed heuristic algorithms in a very short time.
Keywords:
batch-processing machine
total weighted tardiness
scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more