7 - Scheduling Flashcards

1
Q

What is Scheduling?

A

Scheduling is a decision-making process that is used on a regular basis in many manufacturing and service industries

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

Scheduling deals with…

A

Scheduling deals with the allocation of resources to tasks over given time periods and its goal is to optimize one or more objectives

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

Example for resources, tasks and obejectives in Scheduling

A

The resources may be machines in a workshop, runways at an airport, crews at a construction site, processing units in a computing environment, and so on

The tasks may be operations in a production process, take-offs and landings at an airport, stages in a construction project, executions of computer programs, and so on
Each task may have a certain priority level, an earliest possible starting time or a due date

The objectives can also take many different forms. One objective may be the minimization of the completion time of the last task and another may be the minimization of the number of tasks completed after their respective due dates

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

Scheduling Framework and notation

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

Scheduling Framework and notation Triplet

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

Machine environment α

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

Processing characteristics and constraints: β

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

Objective: γ

Overview of possible functions of the due dates

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

Objective: γ

4 different Objective functions

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

P_m | | C_max MIP

Parallel machine models

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

Longest Processing Time (LPT) heuristic

Parallel machine models C_max

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

Examples for the Longest Processing Time (LPT) heuristic

Parallel machine models C_max

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

Local search heuristic (Overview and Design criteria)

Parallel machine models C_max

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

Local search heuristic

Algorithm for the problem Pm | | Cmax

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

Local search heuristic

Big Example

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q
A
17
Q
A
18
Q
A
19
Q

Preemptive models

A
20
Q

Buffer in the flow shop model

A
21
Q

Overview and Algorithm

A
22
Q

Example

A
23
Q
A
24
Q

Job shop model

Introduction overview

A
25
Q

General Description and Algorithm

A
26
Q

Example

A
27
Q
A