Work

Two new approximation schemes for maximizing the weighted number of just-in-time jobs in a multi-machine proportionate flow shop

Year: 2025

Type: article

Abstract: We propose two new fully polynomial-time approximation schemes for maximizing the weighted number of just-in-time jobs in a multi-machine proportionate flow shop. Both are set up using recently proposed frameworks for the construction of this type of approximation schemes for monotone dynamic programming formulations, and are faster by a linear factor with respect to the number of jobs, up to log terms, compared to the state-of-the-art fully polynomial-time approximation scheme for the problem.

Source: Discrete Applied Mathematics

DOI: 10.1016/j.dam.2025.08.008

Authors: Stanisław Gawiejnowicz, Nir Halman

Institutions: Adam Mickiewicz University in Poznań, 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: $3,090

Funders: United States-Israel Binational Science Foundation, Israel Science Foundation