Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the variable common due date, minimal tardy jobs bicriteria
  two-machine flow shop problem with ordered machines   We consider a special case of 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) by efficient implementation using recently introduced
modified binary tree data structure.

30
The categories of this paper are: q-alg
34
The categories of this paper are: chem-ph
8
The categories of this paper are: hep-ex
19
The categories of this paper are: eess
22
The categories of this paper are: chao-dyn
23
The categories of this paper are: solv-int
20
The categories of this paper are: acc-phys
26
The categories of this paper are: bayes-an
18
The categories of this paper are: econ
9
The categories of this paper are: nlin
6
The categories of this paper are: astro-ph
5
The categories of this paper are: gr-qc
28
The categories of this paper are: alg-geom
33
The categories of this paper are: plasm-ph
36
The categories of this paper are: cmp-lg
24
The categories of this paper are: dg-ga