Karn Plongon

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
We consider the problem of determining the production schedule of n jobs on m non-identical parallel machines so that the sum of earliness and tardiness penalties is minimised. In the problem, each job has its own due date, earliness penalty, and tardiness penalty. To reduce the size of possible solution set, the problem is reduced to the job sequencing(More)
  • 1