Dual-machine pipeline job scheduling
Description
CodeVS 3008 Processing and Production Scheduling
Luogu P1561 Mountain Climbing
The common algorithm is the Johnson algorithm for the Hint
two-machine flow job scheduling problem. Here are several articles related to it:
P1187 Processing and Production Scheduling
Optimal Flow Job Scheduling Problem
We enter a d table: $d[i]=(a[i],b[i])$ indicates the processing time of the workpiece number i in workshop A and the processing time in workshop B.
As said in two papers: $$
To minimize the total idle time:
(1) The parts with the shortest processing time in workshop A should be processed first, so that workshop B can start processing at the fastest speed;
(2) The parts with the shortest processing time in workshop B should be processed first. The product is placed in the final processing, so that the idle time of the final A workshop is at least $$
Code