Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times11Supported partially by State Science and Technology Commission and National Natural Science Foundation of China.

Authors:
Guo-Hui Lin;En-Yu Yao;Yong He
Affiliations:
Institute of Applied Mathematics, Chinese Academy of Sciences, P.O. Box 2734, Beijing 100080, China;Department of Applied Mathematics, Zhejiang University, Hangzhou 310027, China;Department of Applied Mathematics, Zhejiang University, Hangzhou 310027, China
Venue:
Operations Research Letters
Year:
1998

Citing 3
Cited 1

Parallel machines scheduling with nonsimultaneous machine available time

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The exact LPT-bound for maximizing the minimum completion time

Operations Research Letters

Development Of A New Heuristic For Scheduling Flow-Shops With Parallel Machines By Prioritizing Bottleneck Stages

Journal of Integrated Design & Process Science - Manufacturing And Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a generalized version of the classical parallel machine scheduling problem, in which the m machines are available at time a"j=0,j=1,2,...,m. The objective function is to maximize the minimum machine completion time. Using the conventional weighting function technique, previously, a lower bound of 58 has been shown for the worst-case performance ratio of the famous Longest Processing Timing (LPT) approximation. In this paper, we develop a new method, called matching, and show that the worst-case performance ratio of LPT is exactly (2m-1)/(3m-2). We also give an instance to indicate the tightness of this ratio.