Parallel-machine scheduling with an availability constraint

Authors:
Chuanli Zhao;Min Ji;Hengyong Tang
Affiliations:
School of Mathematics and Systems Science, Shenyang Normal University, Shenyang, Liaoning 110034, PR China;School of Computer Science and Information Engineering, Contemporary Business and Trade Research Center, Zhejiang Gongshang University, Hangzhou, Zhejiang 310018, PR China;School of Mathematics and Systems Science, Shenyang Normal University, Shenyang, Liaoning 110034, PR China
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 6
Cited 0

Capacitated two-parallel machines scheduling to minimize sum of job completion times

Discrete Applied Mathematics
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

Journal of Heuristics
A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem

Operations Research
The effect of machine availability on the worst-case performance of LPT

Discrete Applied Mathematics
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
Minimizing the sum of job completion times on capacitated parallel machines

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

e consider two parallel machines scheduling problem where one machine is not available in a specified time period. The unavailable time period is fixed and known in advance. The objective is to minimize the total weighted completion time. The problem is known to be NP-hard. We give a fully polynomial-time approximation scheme (FPTAS) for the problem. We then generalize the results to the case with m parallel machines.