Ali Obeid

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1