6533b7d5fe1ef96bd1264f87
RESEARCH PRODUCT
Integer Preemption Problems
Sacramento QuintanillaPilar LinoVicente VallsÁNgeles PérezFrancisco Ballestínsubject
Mathematical optimizationWork (electrical)Job shop schedulingComputer sciencePreemptionWork contentMinificationSchedule (project management)Duration (project management)Integer (computer science)description
A fundamental assumption in the basic RCPSP is that activities in progress are non-preemptable. Some papers reveal the potential benefits of allowing activity interruptions in the schedule when the objective is the makespan minimization. In this chapter we consider the Maxnint_PRCPSP in which it is assumed that activities can be interrupted at any integer time instant with no cost incurred, that each activity can be split into a maximum number of parts, and that each part has a minimum duration established. We show how some procedures developed for the RCPSP can be adapted to work with the Maxnint_PRCPSP and we introduce some procedures specifically designed for this problem. Furthermore, precedence relationships between activities can refer to portions of work content or periods of time. In single-modal project scheduling when interruption is not allowed, both are equivalent but not when preemption is considered. We present a study of generalized work and time precedence relationships and all conversions amongst them.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2014-10-08 |