arbiter
JournalsPricingAccount

Dynamic Programming for Proportionate Flow-Shop Scheduling with Due-Date Assignment

Lei Pan et al.

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

What the paper says

This paper examines proportionate flow-shop scheduling with general earliness/tardiness costs under two due-date assignment models: the common and slack models. The objective is to determine the optimal job sequence and due dates to minimize a total penalty function that includes earliness and tardiness penalties, the number of early and delayed jobs, and the due-date assignment cost. Several optimal structural properties are derived, and two polynomial-time dynamic programming (DP) algorithms are proposed to solve the problems, with a time complexity of [Formula: see text], and [Formula: see text] is the number of jobs.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1142/s0217595926500028

Or copy a formatted citation

@article{lei2026,
  title        = {{Dynamic Programming for Proportionate Flow-Shop Scheduling with Due-Date Assignment}},
  author       = {Lei Pan et al.},
  journal      = {Asia-Pacific Journal of Operational Research},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1142/s0217595926500028},
}

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

Flag this paper

Dynamic Programming for Proportionate Flow-Shop Scheduling with Due-Date Assignment

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.