Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
Minimizing Total Number Of Tardy Jobs In Parallel Batch Processing Machines Using Column Generation And Simulated Annealing, Sameer Neupane
Minimizing Total Number Of Tardy Jobs In Parallel Batch Processing Machines Using Column Generation And Simulated Annealing, Sameer Neupane
Graduate Research Theses & Dissertations
This research considers a scheduling problem where jobs need to be grouped into batches and the batches need to be scheduled on parallel batch processing machines with an objective to minimize the total number of tardy jobs. The jobs are assigned to batches in such a way that machine capacity is not violated. This research considers jobs with unequal ready times, unequal processing times and unequal sizes. The machines are identical in processing capabilities; however, their capacities are different. This research aims to develop effective solution approaches to solve the problem under study. A Mixed Integer Linear Programming (MILP) model …
Sky Surveys Scheduling Using Reinforcement Learning, Andres Felipe Alba Hernandez
Sky Surveys Scheduling Using Reinforcement Learning, Andres Felipe Alba Hernandez
Graduate Research Theses & Dissertations
Modern cosmic sky surveys (e.g., CMB S4, DES, LSST) collect a complex diversity of astronomical objects. Each of class of objects presents different requirements for observation time and sensitivity. For determining the best sequence of exposures for mapping the sky systematically, conventional scheduling methods do not optimize the use of survey time and resources. Dynamic sky survey scheduling is an NP-hard problem that has been therefore treated primarily with heuristic methods. We present an alternative scheduling method based on reinforcement learning (RL) that aims to optimize the use of telescope resources for scheduling sky surveys.
We present an exploration of …