| | |
| | |
Stat |
Members: 3645 Articles: 2'504'585 Articles rated: 2609
24 April 2024 |
|
| | | |
|
Article overview
| |
|
On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines | Aleksandar Ilic
; | Date: |
24 Jul 2013 | Abstract: | We consider the ordinary NP-hard two-machine flow shop problem with the
objective of determining simultaneously a minimal common due date and the
minimal number of tardy jobs. In [S. S. Panwalkar, C. Koulamas, An O(n^2)
algorithm for the variable common due date, minimal tardy jobs bicriteria
two-machine flow shop problem with ordered machines, European Journal of
Operational Research 221 (2012), 7-13.], the authors presented quadratic
algorithm for the problem when each job has its smaller processing time on the
first machine. In this note, we improve the running time of the algorithm to
O(n log n) using recently introduced modi?ed binary tree data structure.
Furthermore, we present O(n^2) algorithm for the scheduling sequence minimizing
makespan for the no-wait variant. | Source: | arXiv, 1307.6505 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |