Study on Multiple Due-Windows Assignment Scheduling with Learning and Deteriorating Effects

Hai-Ruo Song et al.

Asia-Pacific Journal of Operational Research2026https://doi.org/10.1142/s0217595926500016article
AJG 1
Weight
0.50

What the paper says

This paper focuses on the single-machine scheduling problems with multiple due-windows and learning and deteriorating effects, where the actual processing time of the job is a function of its starting time and position in a sequence. The aim is to minimize the weighted sum of the earliness, tardiness and the due-windows costs. Under common due-windows and slack due-windows, the optimal properties of the problems are analyzed and each of the above problems can be transformed into an assignment problem. An algorithm with a time complexity of [Formula: see text] is presented, and the effectiveness of the algorithm is verified by an example, where [Formula: see text] is the number of jobs.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1142/s0217595926500016

Or copy a formatted citation

@article{hai-ruo2026,
  title        = {{Study on Multiple Due-Windows Assignment Scheduling with Learning and Deteriorating Effects}},
  author       = {Hai-Ruo Song et al.},
  journal      = {Asia-Pacific Journal of Operational Research},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1142/s0217595926500016},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Study on Multiple Due-Windows Assignment Scheduling with Learning and Deteriorating Effects

Flags are reviewed by the Arbiter methodology team within 5 business days.


Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.