Proportionate flowshop scheduling with common due window and job rejection

This paper considers a proportionate flowshop scheduling problem with a common due window (CONW) and position-dependent weights. The objective is to determine the set of jobs to be processed, their processing sequence, and the rejected jobs so as to minimize a composite cost function, which consists of scheduling costs (earliness, tardiness, and due window costs) and rejection costs. We establish an equivalence between the proportionate flowshop model and a corresponding single machine model under the CONW setting, and exploit structural properties of the single machine problem to solve the proportionate flowshop problem with job rejection. For this setting, we develop a dynamic programming algorithm with a time complexity of $O({n^3})$.

Authors

Institutions

Publication Details

Journal
Journal of the Operational Research Society
Published
2026-11-14
DOI
https://doi.org/10.1080/01605682.2026.2757163
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Proportionate flowshop scheduling with common due window and job rejection

Zheng Nai-Jia, Wang Xu, Wang Jing, Geng Xin-Na
1 links
Journal of the Operational Research Society
Scheduling and Optimization Algorithms
article

Proportionate flowshop scheduling with common due window and job rejection

Zheng Nai-Jia, Wang Xu, Wang Jing, Geng Xin-Na
article en

Abstract

This paper considers a proportionate flowshop scheduling problem with a common due window (CONW) and position-dependent weights. The objective is to determine the set of jobs to be processed, their processing sequence, and the rejected jobs so as to minimize a composite cost function, which consists of scheduling costs (earliness, tardiness, and due window costs) and rejection costs. We establish an equivalence between the proportionate flowshop model and a corresponding single machine model under the CONW setting, and exploit structural properties of the single machine problem to solve the proportionate flowshop problem with job rejection. For this setting, we develop a dynamic programming algorithm with a time complexity of $O({n^3})$.

Journal of the Operational Research Society
Shenyang Aerospace University (CN), Northwestern Polytechnical University (CN), Xi'an Jiaotong University (CN), Northwestern Polytechnic University (US)
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon