Machine Bottleneck Scheduling
 Share
The version of the browser you are using is no longer supported. Please upgrade to a supported browser.Dismiss

 
View only
 
 
ABCDEFGHIJKLMNOPQRSTUVWXYZ
1
Machine Bottleneck Scheduling
2
3
The objective is to schedule jobs on a machine to minimize a weighted sum of the last finish time, the maximum past due, and sum of past dues. Disjunctive constraints indicate the ordering of jobs.This spreadsheet uses the OpenSolver Add-on. The Green cells denote user input, yellow are decision variable determined by the solver, and the red cell is the problem objective.
4
5
ValueWeightObjective
6
Makespan300.13
7
Maximum Past Due
150.11.5
8
Sum of Past Dues
16116
9
Objective to Minimize
16.45
10
11
Job Table
12
IDreleasedurationduestartfinishpastdue
due + pastdue
13
A251027010
14
B56211420021
15
C481522301530
16
D0410711111
17
E0250205
18
F83151114015
19
G92222022022
20
21
Pairwise Disjunctive Ordering Constraints
22
BigM100
23
yI before JJ before I
24
Job IJob JI before Jfinish_i <= start_j + M*(1-y)finish_j <=start_i + M*y
25
AB171420102
26
AC172230102
27
AD17711102
28
AE0710022
29
AF171114102
30
AG172022102
31
BC1202230114
32
BD0201071114
33
BE020100214
34
BF0201111414
35
BG1202022114
36
CD0301071122
37
CE030100222
38
CF0301111422
39
CG0301202222
40
DE01110027
41
DF1111114107
42
DG1112022107
43
EF121114100
44
EG122022100
45
FG1142022111
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
Loading...
 
 
 
Sheet1
__OpenSolverCache__
__OpenSolver__
__Solver__