Lot-order assignment applying priority rules for the single-machine total tardiness scheduling with nonnegative time-dependent processing times
From MaRDI portal
Publication:1665667
DOI10.1155/2015/434653zbMath1394.90283OpenAlexW1545722440WikidataQ59118576 ScholiaQ59118576MaRDI QIDQ1665667
Jae-Gon Kim, June-Young Bang, Seung-Kil Lim
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/434653
Cites Work
- Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information
- Some single-machine scheduling problems with general effects of learning and deterioration
- Semiconductor lot allocation using robust optimization
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- The single-machine total tardiness scheduling problem: review and extensions
- A concise survey of scheduling with time-dependent processing times
- A backward approach in list scheduling algorithms for multi-machine tardiness problems
- Some scheduling problems with general position-dependent and time-dependent learning effects
- A survey of scheduling problems with setup times or costs
- Evaluation of heuristics for a class-constrained lot-to-order matching problem in semiconductor manufacturing
- Comparison and evaluation of lot-to-order matching policies for a semiconductor assembly and test facility
- Bin covering algorithms in the second stage of the lot to order matching problem
- Using dispatching rules for job shop scheduling with due date-based objectives
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
