Sciact
  • EN
  • RU

Customer order scheduling to minimize the number of late jobs Full article

Journal European Journal of Operational Research
ISSN: 0377-2217
Output data Year: 2007, Volume: 183, Number: 2, Pages: 944-948 Pages count : 5 DOI: 10.1016/j.ejor.2006.10.021
Tags Approximability; Approximation algorithm; Multicover problem; Number of late jobs; Order scheduling
Authors Lin B.M.T. 1 , Kononov A.V. 2
Affiliations
1 National Yang Ming Chiao Tung University
2 Sobolev Institute of Mathematics
Cite: Lin B.M.T. , Kononov A.V.
Customer order scheduling to minimize the number of late jobs
European Journal of Operational Research. 2007. V.183. N2. P.944-948. DOI: 10.1016/j.ejor.2006.10.021 WOS Scopus OpenAlex
Dates:
Submitted: Jan 12, 2006
Accepted: Oct 13, 2006
Identifiers:
Web of science: WOS:000247827500034
Scopus: 2-s2.0-34249978133
OpenAlex: W2056708811
Citing:
DB Citing
Scopus 37
OpenAlex 36
Web of science 31
Altmetrics: