Scheduling and sequencing, del 2 Flashcards

1
Q

Describe FCFS

A

FCFS = First come, first served
- Focuses only on the time of arrival for the customer or job – no priority rule
- Fair
- Urgent orders may wait for less urgent orders
- Orders with short short processing time may wait for order with longer processing time to be completed.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
1
Q

Sequencing rules when prioritizing jobs that arrive intermittently (med jämna mellanrum) –> one process:

A

FCFS
FNO

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Describe FNO

A

FNO = Fewest number of operations remaining
- Does not consider the length of time for each operation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Sequencing rules when prioritizing jobs in the short term - one process:

A

SPT
EDD
LWR

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

DEscribe SPT

A

SPT = Shortest processing time

  • Tends to minimize average flow time and WIP inventory and miximize resource utilization
  • Risk of tardiness of orders with long processing time if new sequences of orders are made continuously
  • Flow time = Que time + Processing time
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Describe EDD

A

EDD = Earliest due date
- Minimizes the maximum of jobs past the due date
- Does not perform well on average flow time, WIP inventory or resource utilization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Describe LWR

A

LWR = Least work remaining
- Sum of all processing times for operations not yet performed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Vad är one process samt two process problems?

A

One process = en enda maskin eller arbetsstation

Two process = två maskiner / arbetsstationer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Vad används vid two processes?

A

Johnsons rule

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Beskriv de 4 stegen i Johnsons rule

A

Step 1 - List the jobs and their processing times on Resources #1 and #2

Step 2 - Find the job with the shortest sequencing time

Step 3 - If this time corresponds to Resource #1, sequence the job first; if it corresponds to resource #2, sequence the job last

Step 4 - Repeat steps 2 and 3 using the next-shortest processing time

  • Work inward from both ends of the sequence until all jobs have been schedule
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Vad är vehicle routing problem?

A

Ett optimeringsproblem där målet är att hitta “best routes”, dvs med kortaste distans eller lägst kostnad, för a fleet of vehicles

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

How to find best option in vehicle problem?

A

Through enumeration. Enumeration is carried out for all possible route to find the best route plan and shortest total delivery time. It helps reduce operating costs and greenhouse gas emissions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Vad är Clark-Wright Heurestic Method?

A

En metod som utgår från att varje kund is serviced individually from the depot.

Metoden går sedan ut på att kombinera kunder i längre routes för att minska total travel time and remain withthin capacity requirements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly