Parallel machine scheduling with s-precedence constraints

Posner, Marc and Kim, Eun-Seok (2007) Parallel machine scheduling with s-precedence constraints. In: INFORMS Annual Meeting, 4-7 November, 2007, Seattle, WA, U.S.A.. (Unpublished)

Full text is not in this repository.

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:Middlesex University Schools and Centres > Business School > International Management and Innovation
ID Code:9441
Deposited On:01 Nov 2012 06:04
Last Modified:30 Oct 2014 14:48

Repository staff only: item control page

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year