Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation
Gordon, V.S., Potts, C.N., Strusevich, V.A. and Whitehead, J.D. (2008) Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. Journal of Scheduling, 11 (5). pp. 357-370. ISSN 1094-6136 (Print), 1099-1425 (Online) (doi:10.1007/s10951-008-0064-x)Full text not available from this repository.
We consider various single machine scheduling problems in which the processing time of a job depends either on its position in a processing sequence or on its start time. We focus on problems of minimizing the makespan or the sum of (weighted) completion times of the jobs. In many situations we show that the objective function is priority-generating, and therefore the corresponding scheduling problem under series-parallel precedence constraints is polynomially solvable. In other situations we provide counter-examples that show that the objective function is not priority-generating.
|Additional Information:|| Published online: 13 May 2008.|
|Uncontrolled Keywords:||single machine scheduling, deteriorating jobs, learning effect, precedence constraints, priority-generating functions|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Pre-2014 Departments:||School of Computing & Mathematical Sciences
School of Computing & Mathematical Sciences > Department of Mathematical Sciences
School of Computing & Mathematical Sciences > Statistics & Operational Research Group
|Last Modified:||14 Oct 2016 09:03|
Actions (login required)