Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs
From MaRDI portal
Publication:2994782
DOI10.1057/jors.2010.26zbMath1210.90095OpenAlexW2042728215MaRDI QIDQ2994782
No author found.
Publication date: 29 April 2011
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.2010.26
schedulingdeteriorating jobssingle machineheuristic algorithmtotal absolute differences in waiting times
Related Items (7)
A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ Minimizing the total waiting time of intermediate products in a manufacturing process ⋮ Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time ⋮ Single-machine ready times scheduling with group technology and proportional linear deterioration ⋮ Single Machine Two-Agent Scheduling with Deteriorating Jobs ⋮ Single-machine scheduling problems with precedence constraints and simple linear deterioration
This page was built for publication: Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs
