Dynamic Programming for Proportionate Flow-Shop Scheduling with Due-Date Assignment
Asia-Pacific Journal of Operational Research · 2026-12 · 43 (06)
DOI: 10.1142/s0217595926500028 ↗Kurz gefasst
Fachartikel in der Zeitschrift Asia-Pacific Journal of Operational Research, online erschienen am 20.02.2026. Verfasst von Lei Pan und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 74 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
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.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Pan, L., Sun, X., & Geng, X. (2026). Dynamic Programming for Proportionate Flow-Shop Scheduling with Due-Date Assignment. Asia-Pacific Journal of Operational Research, 43(06). https://doi.org/10.1142/s0217595926500028
Vancouver
Pan L, Sun X, Geng X. Dynamic Programming for Proportionate Flow-Shop Scheduling with Due-Date Assignment. Asia-Pacific Journal of Operational Research. 2026;43(06). doi:10.1142/s0217595926500028
BibTeX
@article{Pan2026,
author = {Pan, Lei and Sun, Xinyu and Geng, Xin-Na},
title = {Dynamic Programming for Proportionate Flow-Shop Scheduling with Due-Date Assignment},
journal = {Asia-Pacific Journal of Operational Research},
year = {2026},
volume = {43},
number = {06},
doi = {10.1142/s0217595926500028}
}
EUVIMED