Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Optimally rescheduling jobs with a LIFO buffer   This paper considers single-machine scheduling problems in which a given
solution, i.e. an ordered set of jobs, has to be improved as much as possible
by re-sequencing the jobs. The need for rescheduling may arise in different
contexts, e.g. due to changes in the job data or because of the local objective
in a stage of a supply chain \red{that is} not aligned with the given sequence.
A common production setting entails the movement of jobs (or parts) on a
conveyor. This is reflected in our model by facilitating the re-sequencing of
jobs via a buffer of limited capacity accessible by a LIFO policy. We consider
the classical objective functions of total weighted completion time, maximum
lateness and (weighted) number of late jobs and study their complexity. For
three of these problems we present strictly polynomial-time dynamic programming
algorithms, while for the case of minimizing the weighted number of late jobs
NP-hardness is proven and a pseudo-polynomial algorithm is given.

31
The categories of this paper are: ao-sci
37
The categories of this paper are: supr-con
3
The categories of this paper are: physics
25
The categories of this paper are: patt-sol
14
The categories of this paper are: math-ph
23
The categories of this paper are: solv-int
30
The categories of this paper are: q-alg
15
The categories of this paper are: nucl-ex
27
The categories of this paper are: comp-gas
22
The categories of this paper are: chao-dyn
20
The categories of this paper are: acc-phys
28
The categories of this paper are: alg-geom
16
The categories of this paper are: stat
0
The categories of this paper are: hep-ph
8
The categories of this paper are: hep-ex
29
The categories of this paper are: funct-an