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]

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.

Actions (login required)

View Item