Parallel machine scheduling with s-precedence constraints [article]

Kim, Eun-Seok and Posner, Marc E. (2010) Parallel machine scheduling with s-precedence constraints [article]. IIE Transactions, 42 (7). pp. 525-537. ISSN 0740-817X

Full text is not in this repository.

Abstract

For s-precedence constraints, job i cannot start processing until all jobs that precede i start. This is different from the standard definition of a precedence relation where i cannot start until all prior jobs complete. While not discussed in the scheduling literature, s-precedence constraints have wide applicability in real-world settings such as first-come, first-served processing systems. This article considers a deterministic scheduling problem where jobs with s-precedence relations are processed by multiple identical parallel machines. The objective is to minimize the makespan. The problem is shown to be intractable. A heuristic procedure is developed and tight worst-case bounds on the relative error are derived. Finally, computational experiments show that the proposed heuristic provides effective solutions.

Item Type: Article
Research Areas: A. > Business School > International Management and Innovation
Item ID: 11240
Depositing User: Teddy ~
Date Deposited: 10 Jul 2013 11:05
Last Modified: 12 Sep 2017 14:04
URI: https://eprints.mdx.ac.uk/id/eprint/11240

Actions (login required)

Edit Item Edit Item