may start at 12:01 A.M., 4:01 A.M., 8:01 A.M., 12:01 P.M., 4:01 P.M., and 8:01 P.M. Thus, the vari- ables may be defined as X1 = number of buses starting at 12: 01 A.M. X2 = number of buses starting at 4:01 A.M. x3 = number of buses starting at 8:01 A.M. x4 = number of buses starting at 12:01 P.M. x3 = number of buses starting at 4:01 P.M. x6 = number of buses starting at 8:01 P.M. We can see from Figure 2.8 that because of the overlapping of the shifts, the number of buses for the successive 4-hour periods is given as Time period Number of buses in operation 12:01 A.M. - 4:00 A.M. 4:01 A.M. -8:00 A.M. 8:01 A.M. - 12:00 noon 12:01 P.M. - 4:00 P.M. 4:01 P.M. - 8:00 P.M. X1 + X6 X, + x2 X3 + X4 X4 + X's Xs + X6 8:01 A.M. – 12:00 A.M. The complete model is thus written as Minimize z = x, + x2 + x3 + *4 + xs + X6 subject to + xo 2 4 (12:01 A.M.-4:00 A.M.) 2 8 (4:01 A.M.-8:00 A.M.) x + x2 X2 + X3 2 10 (8:01 A.M.-12:00 noon) Xz + x4 2 7 (12:01 P.M.-4:00 P.M.) X4 + x3 2 12 (4:01 P.M.-8:00 P.M.) xs + x6 4 (8:01 P.M.-12:00 P.M.) x, 2 0, j= 1,2,.., 6 Solution: The optimal solution calls for using 26 buses to satisfy the demand with x, = 4 buses to start at 12:01 A.M., X2 = 10 at 4:01 A.M., x4 = 8 at 12:01 P.M., and xs = 4 at 4:01 P.M.
may start at 12:01 A.M., 4:01 A.M., 8:01 A.M., 12:01 P.M., 4:01 P.M., and 8:01 P.M. Thus, the vari- ables may be defined as X1 = number of buses starting at 12: 01 A.M. X2 = number of buses starting at 4:01 A.M. x3 = number of buses starting at 8:01 A.M. x4 = number of buses starting at 12:01 P.M. x3 = number of buses starting at 4:01 P.M. x6 = number of buses starting at 8:01 P.M. We can see from Figure 2.8 that because of the overlapping of the shifts, the number of buses for the successive 4-hour periods is given as Time period Number of buses in operation 12:01 A.M. - 4:00 A.M. 4:01 A.M. -8:00 A.M. 8:01 A.M. - 12:00 noon 12:01 P.M. - 4:00 P.M. 4:01 P.M. - 8:00 P.M. X1 + X6 X, + x2 X3 + X4 X4 + X's Xs + X6 8:01 A.M. – 12:00 A.M. The complete model is thus written as Minimize z = x, + x2 + x3 + *4 + xs + X6 subject to + xo 2 4 (12:01 A.M.-4:00 A.M.) 2 8 (4:01 A.M.-8:00 A.M.) x + x2 X2 + X3 2 10 (8:01 A.M.-12:00 noon) Xz + x4 2 7 (12:01 P.M.-4:00 P.M.) X4 + x3 2 12 (4:01 P.M.-8:00 P.M.) xs + x6 4 (8:01 P.M.-12:00 P.M.) x, 2 0, j= 1,2,.., 6 Solution: The optimal solution calls for using 26 buses to satisfy the demand with x, = 4 buses to start at 12:01 A.M., X2 = 10 at 4:01 A.M., x4 = 8 at 12:01 P.M., and xs = 4 at 4:01 P.M.
Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter12: Queueing Models
Section: Chapter Questions
Problem 59P
Related questions
Question
Find the optimal solution using excel solver.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 4 images
Recommended textbooks for you
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,