Week 5 Flashcards Preview

Operations Management > Week 5 > Flashcards

Flashcards in Week 5 Deck (22)
Loading flashcards...
1
Q

What decisions need to be made for a good layout?

A
Material handling equipment
Capacity and space requirements
Environment and aesthetics
Flows of information
Cost of moving between various work areas
2
Q

What is a job shop process flow structure?

A

Absolutely unique products are made under the usage of standard tools in very low quantities

3
Q

What does being process-focused mean?

A

A form of production in which workstations are grouped according to type of process performed and equipment

4
Q

What is a flow shop (line layout)?

A

A lot of the same products are made using assembly lines

5
Q

What is a dominant product flow?

A

(almost) all items follow through the workstations according to the same sequence

6
Q

What does being product focused mean?

A

A form of production processing organization in which workstations are organized according to the type of product being produced

7
Q

What is a batch flow production system?

A

A mixed approach between job shop and line layout

8
Q

What is a minimum-makespan general job-shop scheduling problem(JSSP)?

A

A set of n jobs, which are to be processed on a set of m machines, Each job needs to be processed according to a predefined sequence of machines, and for each job and machine combination the processing time is known

9
Q

What is the makespan?

A

TIme it takes to complete all jobs

10
Q

What is a dispatching rule based heuristic?

A

Heuristic that aims to construct a schedule based on the earliest start time principle

11
Q

What is the shortest processing time (SPT)?

A

Tie breaker that says that the shortest job should be completed first

12
Q

What do MAT & JAT mean in the dispatching rule based heuristic?

A

Machien available time & Job available time

13
Q

What are alternative dispatching rules?

A

Random : pick random job in queue
First come, first serve: jobs are processed in order they arrive
Shortest processing time: Pick job which is done fastest
Earliest due date: Prioritize job that has earliest due date
Critical ratio: time until job is due/total shop time remaining–>pick lowest
Slack time = time until job is due-total shop time remaining –>pick lowest
Slack time per remaining per operation: slack time divided by number of operations remaining –>pick lowest

14
Q

What is a precedence diagram?

A

Diagram which displays which tasks need to be performed in which order

15
Q

What is the production rate of an assembly?

A

Number of units that the line produces per time unit

16
Q

What is the cycle time?

A

The time required to output one unit

17
Q

What is the takt time?

A

The reciprocal of the desired production rate, maximum feasible cycle time

18
Q

What is the idle time of an assembly line?

A

Total time that the workstations are not occupied during a production cycle

19
Q

What is the efficiency of an assembly line?

A

Total time that the workstations are not occupied over total production maximum time

20
Q

What is theoretical minimum number of workstations (L)?

A

Lower bound regarding the optimal number of workstations

L = (sum of job times)/T, where T is take time

21
Q

What kind of priority coefficients can be chosen for an assembly line heuristic?

A

Longest task time: choose task with highest task time
Most following task time: choose task with most number of following tasks
Ranked positional weight: Choose task with highest total time of tasks following it, including itself
Shortest task time: choose task with lowest task time
Least number of following task: Choose task with lowest number of following tasks
COmputer Method of Sequencing Operations for Assembly Lines (COMSOAL): Randomly chooses operations, performs this often and chooses best one

22
Q

What are some examples of additional difficulties in simple assembly line balancing problem?

A
  1. Do not balance, but re-balance
  2. Workstations have identities
  3. Cannot eliminate workstations
  4. Need to equalize loads
  5. Multiple operators
  6. Multiple-operator operations
  7. Multiple products