A branch-and-price algorithm for the general case of scheduling parallel machines with a single server

Authors:
Heng-Soon Gan;Andrew Wirth;Amir Abdekhodaee
Affiliations:
Department of Mathematics and Statistics, University of Melbourne, VIC 3010, Australia;Department of Mechanical Engineering, University of Melbourne, VIC 3010, Australia;Faculty of Engineering and Industrial Sciences, Swinburne University of Technology, PO Box 218 Hawthorn, VIC 3122, Australia
Venue:
Computers and Operations Research
Year:
2012

Citing 3
Cited 0

Parallel machine scheduling with a common server

Discrete Applied Mathematics
Scheduling parallel machines with a single server: some solvable cases and heuristics

Computers and Operations Research
Equal processing and equal setup time cases of scheduling parallel machines with a single server

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

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, in turn generated by some well known heuristics, to achieve effective and efficient solutions. We compare the performance of this method with those proposed earlier and also suggest future work.