Photo by sevcovic23 from unsplash
We consider the permutation flow shop scheduling problem and aim to obtain smoothness of jobs' completion times, by minimising the variance or the variability of inter-completion times. This problem, including… Click to show full abstract
We consider the permutation flow shop scheduling problem and aim to obtain smoothness of jobs' completion times, by minimising the variance or the variability of inter-completion times. This problem, including an efficient heuristics, was introduced in Leisten and Rajendran (2015). Here we solve an open problem from that paper and show that the problem for more than two machines is NP-complete.
Keywords:
permutation flow;
completion;
flow shop;
shop scheduling
Journal Title: International Journal of Operational Research
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: International Journal of Operational Research
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!