Automating Google Workspace (GWS) & more with Apps Script
Presentation schuduling 楊哲愷(線上版)
1. A simple Heuristic
For m-Machine flow-shop &
Its application in
Routing-Scheduling problems
IGOR AVERBAKH, ODED BERMAN
The theory and application of scheduling
Yang che kai. 楊哲愷
2. The breakthrough of this paper
• The special application of Heuristic SYMM.
• In Routing scheduling flow shop
• Not only good at routing part, but scheduling part.
• Focus on traveling’s servers, not traveling jobs.
2014/1/6
3. Outline
• M-machine flow shop problem
• The worst case performance
• A Simple Heuristic performance
• Application to Routing-Scheduling
problem
• Case 1. Permutation Routing-Scheduling flow shop
• Case 2. General Routing scheduling flow-shop
• Further research in the future.
2014/1/6
3
5. m-M/Cs flow shop
performance of the worst case
m=2
Each machine processes the jobs according to sequence
S without unnecessary idle times, starting a new job as
soon as the previous job is processed on that machine
and the new job is available after its execution on the
previous machine.
Job
1
M/C 1
Job
2
Job
3
Job
n-2
Job
n-1
Job
n
Scheduling jobs by a sequence S,
obtained by O(m*n).
M/C 2
OPT-1(S)
Job
1
2014/1/6
…
Job
2
Job
3
…
Job
n-2
Job
n-1
Job
n
5
12. Further research
• Routing open shop scheduling problem.
• Much precisely(efficient) heuristic for routingscheduling problem
• Aerial fleet refueling problem
2014/1/6
12