Scheduling of uniform parallel machines with s-precedence constraints

Kim, Eun-Seok (2011) Scheduling of uniform parallel machines with s-precedence constraints. Mathematical and Computer Modelling, 54 (1-2). pp. 576-583. ISSN 0895-7177

Full text is not in this repository.

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.

Item Type: Article
Research Areas: A. > Business School > International Management and Innovation
Item ID: 9991
Depositing User: Eun-Seok Kim
Date Deposited: 01 Mar 2013 05:54
Last Modified: 12 Sep 2017 14:03
URI: http://eprints.mdx.ac.uk/id/eprint/9991

Actions (login required)

Edit Item Edit Item