Photo by kellysikkema from unsplash
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… Click to show full 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 must determine their execution sequence that minimizes the maximum regret. We develop an exact solution algorithm based on a specialized branch and bound method, using mixed-integer linear programming formulations for a common due-date and for job-dependent due-dates. Finally, we examine the solution algorithm in a series of computational experiments.
Journal Title: Annals of Operations Research
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!