/
GBT Dynamic Scheduling System (DSS) GBT Dynamic Scheduling System (DSS)

GBT Dynamic Scheduling System (DSS) - PowerPoint Presentation

liane-varnes
liane-varnes . @liane-varnes
Follow
435 views
Uploaded On 2016-07-21

GBT Dynamic Scheduling System (DSS) - PPT Presentation

Dana Balser Jim Braatz Mark Clark Jim Condon Ray Creager Mike McCarty Ron Maddalena Paul Marganian Karen ONeil Eric Sessoms Amy Shelton Nomenclature Butler ID: 413497

efficiency observing micron balser observing efficiency balser micron observers lst scoring equation limit weather ftp fsg fcom foos maddalena tttntlettb ltr stability

Share:

Link:

Embed:

Download Presentation from below link

Download Presentation The PPT/PDF document "GBT Dynamic Scheduling System (DSS)" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript

Slide1

GBT Dynamic Scheduling System (DSS)

Dana Balser, Jim Braatz, Mark Clark, Jim Condon, Ray Creager, Mike McCarty, Ron Maddalena, Paul Marganian, Karen O’Neil, Eric Sessoms, Amy SheltonSlide2

Nomenclature

Butler GBTOpen SessionsWindowed SessionsFixed SessionsSlide3

Observing

Scheduling Algorithm24-48 Hours in AdvanceScheduling ProbabilitiesPost-ObservationReports

Data Collection

Advance of Semester

Reports of schedule,

logs, time lost, etc

Phase II

data

collection

Sensitivity

calculator

Time

availability

prediction

Proposal

Submission

Tool

Sciencegrades

How does it work?

Historical

probabilities

Weatherforecasts

Monitor

schedule

Backup

Project run

Observingscripts

Autoscheduler

Run

Scheduler modifiesand approves

Notificationsent

Provided outside the DSS

Provided by the DSS

Requirements

Scheduling observers,

not

scripts

•Observers retain control

•Minimum of 24 hours advance notice for observers

Wide array of hardware

•Cannot increase workload of staff or observersSlide4

Atmospheric Effects

Condon & Balser (2011)Slide5

MaddalenaWeather ForecastsSlide6

Atmospheric Stability

Maddalena; Balser (2011)Pyrgeometer: non-imaging device sensitive to 4.5-40 micron over 150 deg fov.Slide7

Wind Effects

Condon (2003)Slide8

Weather Forecasts: wind

Obs Wind Speed (m/s)Forecast Wind Speed (m/s)DayNightBalser (2010); MaddalenaSlide9

Solar Heating

rms330 micron rms220 micronNikolic et al. (2007) SurfaceWave front errors from OOF maps.Grayscale: +/- 2 radContour: ½ rad intervals

Primary Surface

Day: 300 micron

Night: 250 micron

Offset Pointing

Day

: 3.3

arcsec

Night: 2.7

arcsecSlide10

R =

(

η

S

P

α

β

P

ν

γ

) (

leff

lHA lz

ltr lst

) (foos f

com f

sg

ftp)(tt

tntlet

tb)

Scoring Equation

Weather:

Observing Efficiency

StringencyPressure Factors:

R

ight Ascension Frequency

Performance Limits: Observing Efficiency

Hour AngleZenith AngleT

racking ErrorA

tmospheric Stability

Other Factors:

O

bservers on Site

Completion of

Projects

Science GradesThesis Projects

Temporal Constraints:

T

ransit

Nighttime

LST Exclusion

T

ime BetweenSlide11

R =

(

η

S

P

α

β

P

ν

γ

) (

leff

lHA lz

ltr lst

) (foos f

com f

sg

ftp)(tt

tntlet

tb)

Scoring Equation

Weather:

Observing EfficiencyStringencySlide12

Observing EfficiencySlide13

Observing EfficiencySlide14

StringencySlide15

R =

(

η

S

P

α

β

P

ν

γ

) (

leff

lHA lz

ltr lst

) (foos f

com f

sg

ftp)(tt

tntlet

tb)

Scoring Equation

Pressure Factors:

Right

Ascension FrequencySlide16

Pressure FactorSlide17

R =

(

η

S

P

α

β

P

ν

γ

) (

leff

lHA lz

ltr lst

) (foos f

com f

sg

ftp)(tt

tntlet

tb)

Scoring Equation

Performance Limits:

Observing Efficiency Hour AngleZ

enith AngleTracking ErrorAtmospheric

S

tabilitySlide18

Observing Efficiency LimitSlide19

Hour Angle Limit

Condon & Balser (2011)Slide20

Tracking Error LimitSlide21

Balser

(2011); Mason & Perera (2010)Atmospheric Stability LimitSlide22

Packing (Open Sessions)Problem: a thief with a bag of capacity N, faced with a number (M)

of possible goodies each having a different weight (cost) and value, how do you pack your bag to maximize your take?Brute Force: order (M!)Knapsack Algorithm: order (M*N)N = number of quarter hours to scheduleM = number of potential sessionsOverhead = 15 min.SessomsSlide23

Scheduler PageSlide24

ScheduleSlide25

User Home PageSlide26

User Project PageSlide27

Fini