Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times
Sign Up to like & getrecommendations! Published in 2020 at "Annals of Operations Research"
DOI: 10.1007/s10479-019-03263-6
Abstract: We consider the robust version of single machine scheduling problem with the objective to minimize the weighted number of jobs completed after their due-dates. The jobs have uncertain processing times represented by intervals, and decision-maker… read more here.
Keywords: weighted number; robust min; minimize weighted; processing times ... See more keywords