Abstract

The problem attacked in this paper is the scheduling of n jobs on two machines which are assumed to be continuously available. All jobs are available at the beginning of the scheduling period. Setup times are included in the processing times. No preemption of jobs is allowed. The objective is the minimization of a weighted combination of the average job flowtime and the schedule makespan. Three branch and bound (BB and each one of these problems is solved for five different levels of the weighting factor. An analysis into the resulting efficient points is also included. An improved version of FSH1 (called FSH2) is developed and both heuristics are subjected to extensive numerical experimentation.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call