Scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times using variable neighborhood search

@article{Drieel2009SchedulingJO,
  title={Scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times using variable neighborhood search},
  author={Ren{\'e} Drie\ssel and Lars M{\"o}nch},
  journal={2009 International Conference on Computers & Industrial Engineering},
  year={2009},
  pages={273-278}
}
In this paper, we discuss a scheduling problem for jobs on identical parallel machines. Ready times of the jobs, precedence constraints, and sequence-dependent setup times are considered. We are interested in minimizing the performance measure total weighted tardiness. Scheduling problems of this type are quite important in semiconductor manufacturing. We suggest a variable neighborhood search (VNS) scheme for this problem. Based on computational experiments with stochastically generated test… CONTINUE READING
3 Extracted Citations
14 Extracted References
Similar Papers

Referenced Papers

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

Juan, "An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups

  • Liao, C.-J, H.-C
  • Computers & Operations Research,
  • 2007
1 Excerpt

Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighborhood search

  • M. L. Rocha, M. G. Ravetti, G. R. Mateus, P. M. Pardalos
  • IMA Journal ofManagement Mathematics,
  • 2007
2 Excerpts

Solving single machine total weighted tardiness problems with sequence dependent setup times by meta-heuristics

  • Lin, S.-W, K.-C. Ying
  • International Journal of Advanced Manufacturing…
  • 2007
1 Excerpt

Driessel "A Distributed Shifting Bottleneck Heuristic for Complex Job Shops

  • L. Monch
  • Computers & Industrial Engineering",
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…