Scheduling job families on non-identical parallel machines with time constraints

@article{Obeid2011SchedulingJF,
  title={Scheduling job families on non-identical parallel machines with time constraints},
  author={Ali Obeid and St{\'e}phane Dauz{\`e}re-P{\'e}r{\`e}s and Claude Yugma},
  journal={Proceedings of the 2011 Winter Simulation Conference (WSC)},
  year={2011},
  pages={1994-2005}
}
This paper studies the scheduling of lots (jobs) of different product types (job families) on parallel machines, where not all machines are able (i.e. are qualified) to process all job families (non-identical machines). This is known in the literature as scheduling with machine eligibility restrictions. A special time constraint, associated with each job… CONTINUE READING