What question did this study set out to answer?

The aim is to maximize the total weight of just-in-time jobs that complete on their due dates within a two-stage flexible flow shop.

Maximizing the Total Weight of Just‐In‐Time Jobs in A Two‐Stage Flexible Flow Shop With Dedicated Machines

View Full Paper

Ask AI

Bookmark

Authors

Randomized trial seeks to maximize just-in-time job weights in a two-stage flow shop, suggesting effective scheduling techniques.

The aim is to maximize the total weight of just-in-time jobs that complete on their due dates within a two-stage flexible flow shop.
Examined two configurations of machines: one with a single common bottleneck machine at stage 1 and parallel dedicated machines at stage 2.
Developed a pseudo-polynomial-time dynamic programming algorithm for the first configuration.
Established that the problem is strongly NP-hard for the second configuration and designed a pseudo-polynomial-time algorithm for fixed jobs.
Proposed algorithms effectively address the scheduling challenge for maximizing weight of just-in-time jobs.
Determined the second configuration remains NP-hard, indicating significant complexity in balanced scheduling.
Demonstrated approximation scheme applicability for fixed machine settings in the first configuration.

Chen et al. (2026) studied this question.

View Full Paper

Ask AI

Bookmark