Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints
Kim, Eun-Seok, Sung, Chang-Sup and Lee, Ik-Sun (2009) Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints. Computers & Operations Research, 36 (3) . pp. 698-710. ISSN 0305-0548 [Article] (doi:10.1016/j.cor.2007.10.025)
Abstract
This paper considers a deterministic scheduling problem where multiple jobs with s-precedence relations are processed on multiple identical parallel machines. The objective is to minimize the 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. The s-precedence relation has wide applicability in the real world such as first-come-first-served processing systems. The problem is shown to be intractable, for which a heuristic procedure is derived. Numerical experiments are conducted to show that the derived heuristic provides effective solutions.
Item Type: | Article |
---|---|
Research Areas: | A. > Business School > International Management and Innovation |
Item ID: | 9988 |
Useful Links: | |
Depositing User: | Eun-Seok Kim |
Date Deposited: | 21 Mar 2013 07:27 |
Last Modified: | 12 Sep 2017 14:04 |
URI: | https://eprints.mdx.ac.uk/id/eprint/9988 |
Actions (login required)
![]() |
View Item |
Statistics
Additional statistics are available via IRStats2.