Parallel machine scheduling with s-precedence constraints [conference item]

Conference paper

Posner, M. and Kim, E. 2007. Parallel machine scheduling with s-precedence constraints [conference item]. INFORMS Annual Meeting. Seattle, WA, U.S.A. 04 - 07 Nov 2007
TypeConference paper
TitleParallel machine scheduling with s-precedence constraints [conference item]
AuthorsPosner, M. and Kim, E.
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.

ConferenceINFORMS Annual Meeting
Publication dates
Print01 Jan 2007
Publication process dates
Deposited01 Nov 2012
Output statusPublished
Additional information

INFORMS: The Institute for Operations Research and the Management Sciences

Web address (URL)http://meetings2.informs.org/Seattle07/
LanguageEnglish
Permalink -

https://repository.mdx.ac.uk/item/83vxz

Log in to edit
  • 83
    total views
  • 0
    total downloads
  • 0
    views this month
  • 0
    downloads this month

Export as