Scheduling Jobs on Two Identical Parallel Machines with a Single Server
by Dr Heng-Soon Gan
Abstract: We consider the strongly NP-hard problem of scheduling two-operation non-preemptable jobs on two identical parallel machines. A single server, that can handle at most one job at a time, is available to carry out the first (or setup) operation. The second operation, to be carried out on the same machine but without the server, must be executed immediately after the setup. The objective is to minimize the makespan. We apply a column generation method to a population of partial schedules and report on some initial results.
Bio: Dr Gan is an Operations Research lecturer at the University of Melbourne with the Department of Mathematics and Statistics. He is the Director of the MORe advisory group and lectures several OR subjects, including Optimisation for Industry.
For More Information: contact Christina Burt. email email@example.com