Volume 55, 2021Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
|Page(s)||S727 - S740|
|Published online||02 March 2021|
An FPTAS for just-in-time scheduling of a flow shop manufacturing process with different service quality levels
Bar Ilan University, Ramat Gan 5290002, Israel.
* Corresponding author: firstname.lastname@example.org
Accepted: 27 January 2020
This paper addresses the problem of identifying a profit-maximizing schedule for jobs in a just-in-time production line, where the decision maker can adjust each job’s processing time, and thereby its quality level and the profit that can be gained from it. The system comprises two sequential machines with a transition period between them and a setup time after completion of each job on the second machine. We first construct an exact algorithm that maximizes the profit. Since this problem is NP-hard, we construct a fully polynomial time approximation scheme (FPTAS) to address it and evaluate its computational complexity.
Mathematics Subject Classification: 65D15 / 05Exx / 68Rxx
Key words: Flow shop scheduling / FPTAS / combinatorial optimization / dynamic programming
© EDP Sciences, ROADEF, SMAI 2021
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.