Metaheuristics for scheduling jobs with incompatible families on parallel batching machines

@article{Almeder2011MetaheuristicsFS,
  title={Metaheuristics for scheduling jobs with incompatible families on parallel batching machines},
  author={Christian Almeder and Lars M{\"o}nch},
  journal={JORS},
  year={2011},
  volume={62},
  pages={2083-2096}
}
In this paper, we discuss the scheduling of jobs with incompatible families on parallel batching machines. The performance measure is total weighted tardiness. This research is motivated by a scheduling problem found in the diffusion and oxidation areas of semiconductor wafer fabrication where the machines can be modelled as parallel batch processors. Given that this scheduling problem is NP-hard, we suggest an ant colony optimization (ACO) and a variable neighbourhood search (VNS) approach… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

Meta-heuristic algorithms for scheduling on parallel batch machines with unequal job ready times

2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC) • 2017
View 2 Excerpts

Planning on Discrete Events Systems: A logical approach

2016 IEEE International Conference on Automation Science and Engineering (CASE) • 2016
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 50 references

Variable neighborhood search for parallel batch machine scheduling

C Almeder, L Mönch
Preprints of the VIII Metaheuristics International Conference, Hamburg. • 2009
View 8 Excerpts
Highly Influenced

A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor

M Mathirajan, AI Sivakumar
Int J Adv Manuf Technol 29: 990–1001. • 2006
View 7 Excerpts
Highly Influenced

Scheduling Parallel Batch Processors with Incompatible Job Families Using Ant Colony Optimization

2006 IEEE International Conference on Automation Science and Engineering • 2006
View 7 Excerpts
Highly Influenced

Minimizing total tardiness on a batch processing machine with incompatible job families

SV Mehta, R Uzsoy
IIE Trans 30: 165–178. • 1998
View 9 Excerpts
Highly Influenced

A ‘Pseudopolynomial’ time algorithm for sequencing jobs to minimize total tardiness

EL Lawler
Ann Discrete Math 1: 331–342. • 1977
View 3 Excerpts
Highly Influenced

A population - based variable neighborhood search for the single machine total weighted tardiness problem

F Wilcoxon
Comp Opns Res • 2009

A population-based variable

L Tang
2009
View 1 Excerpt

Similar Papers

Loading similar papers…