Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6895410 | European Journal of Operational Research | 2016 | 11 Pages |
Abstract
We study due-date assignment problems with common flow allowance on a proportionate flowshop. We focus on both minsum and minmax objectives. Both cases are extended to a setting of a due-window. The proposed solution procedures are shown to be significantly different from those of the single machine problems. All the problems studied here are solved in polynomial time: the minsum problems in O(n2) and the minmax problems in O(nlogân), where n is the number of jobs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Baruch Mor, Gur Mosheiov,