Parallel machine scheduling with s-precedence constraints [conference item]
Posner, Marc and Kim, Eun-Seok (2007) Parallel machine scheduling with s-precedence constraints [conference item]. In: INFORMS Annual Meeting, 4-7 November, 2007, Seattle, WA, U.S.A.. . [Conference or Workshop Item]
Official URL: http://meetings2.informs.org/Seattle07/
Abstract
For s-precedence constraints, a job cannot start processing until all preceding jobs have started. While not discussed in the scheduling lecture, s-precedence constraints have wide applicability in real world settings such as FIFO processing systems. We study an identical parallel machine problem where the objective is to minimize the makespan.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Additional Information: | INFORMS: The Institute for Operations Research and the Management Sciences |
Research Areas: | A. > Business School > International Management and Innovation |
Item ID: | 9441 |
Depositing User: | Devika Mohan |
Date Deposited: | 01 Nov 2012 06:04 |
Last Modified: | 12 Sep 2017 14:05 |
URI: | https://eprints.mdx.ac.uk/id/eprint/9441 |
Actions (login required)
![]() |
View Item |
CORE (COnnecting REpositories)