On-line scheduling of two parallel machines with a single server

Authors:
Lele Zhang;Andrew Wirth
Affiliations:
Department of Mechanical Engineering, The University of Melbourne, Vic. 3010, Australia;Department of Mechanical Engineering, The University of Melbourne, Vic. 3010, Australia
Venue:
Computers and Operations Research
Year:
2009

Citing 7
Cited 3

Scheduling two parallel semiautomatic machines to minimize machine interference

Computers and Operations Research
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
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Equal processing and equal setup time cases of scheduling parallel machines with a single server

Computers and Operations Research
Scheduling two parallel machines with a single server: the general case

Computers and Operations Research
Parallel machine scheduling problems with a single server

Mathematical and Computer Modelling: An International Journal

Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server

Computers and Industrial Engineering
Preemptive scheduling on two parallel machines with a single server

Computers and Industrial Engineering
Online LPT algorithms for parallel machines scheduling with a single server

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we consider the on-line scheduling of two parallel identical machines sharing a single server with the objective of minimizing the latest completion time of all jobs. Each job has to be setup by the server before being processed on one of the machines. Three special cases: equal length jobs, equal processing times and regular equal setup times are considered and the asymptotic competitive ratios of list scheduling are determined. Also, a lower bound for the equal length job case is given, and two heuristics with tight asymptotic competitive ratios for the other two cases are proposed.