Work

A faster fully polynomial time approximation scheme for proportionate flow shop scheduling with step-deteriorating processing times

Year: 2025

Type: article

Abstract: We consider a certain proportionate flow shop scheduling problem with step-deteriorating processing times and study two objective functions: makespan and sum of completion times. We reformulate these problems as monotone dynamic programs that fall into both FPTAS frameworks of Alon and Halman. Consequently, we get for each one of them an FPTAS and a strongly polynomial FPTAS, where the latter one improves upon the running time of the fastest FPTAS known to date.

Source: Journal of Scheduling

DOI: 10.1007/s10951-025-00859-8

Author: Nir Halman

Institution: Bar-Ilan University

Language: English

Topic: Scheduling and Optimization Algorithms

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,990

Funders: United States - Israel Binational Science Foundation, United States-Israel Binational Science Foundation, Bar-Ilan University