Scheduling of uniform parallel machines with s-precedence constraints

Authors:
Eun-Seok Kim
Affiliations:
-
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2011

Citing 6
Cited 0

Structure of a simple scheduling polyhedron

Mathematical Programming: Series A and B
Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds

Journal of Algorithms
Generating Experimental Data for Computational Testing with Machine Scheduling Applications

Operations Research
Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints

Computers and Operations Research
Scheduling chain-structured tasks to minimize makespan and mean flow time

Information and Computation
A comment on scheduling on uniform machines under chain-type precedence constraints

Operations Research Letters

Quantified Score

Hi-index	0.98

Visualization

Abstract

This paper considers a problem of scheduling s-precedence constrained jobs on machines in parallel which have different speeds. The objective is to minimize the weighted total completion time. The s-precedence relation between two jobs i and j represents the situation where job j is constrained from processing until job i starts processing, which is different from the standard definition of a precedence relation where j cannot start until i completes. An LP-based heuristic procedure is derived for the problem. Numerical experiments are conducted to show that the derived heuristic finds effective solutions.