Instruct: Given a paper title, retrieve paper titles that are cited by the given paper.
Query: Approximation algorithms for scheduling unrelated parallel machines
Algorithms for Scheduling Tasks on Unrelated Processors
Heuristic Methods for Solving Job-Shop Scheduling Problems
A very fast TS/SA algorithm for the job shop scheduling problem
Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems
Using Simulated Annealing and Ant-Colony Optimization Algorithms to Solve the Scheduling Problem
Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency
Local Optimization and The Job-Shop Scheduling Problem
Two-processor scheduling with start-times and deadlines
The hybrid flow shop scheduling problem
Theory and Practice in Parallel Job Scheduling
Generate pareto optimal solutions of scheduling problems using normal boundary intersection technique
An Experimental Study of Online Scheduling Algorithms
Mathematical Models of Flow Shop and Job Shop Scheduling Problems
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
On the Complexity of Scheduling University Courses
Characterizations of parallelism in applications and their use in scheduling
Constraint-Directed Search: A Case Study of Job-Shop Scheduling
The third comprehensive survey on scheduling problems with setup times/costs
Bin-packing Algorithms for Periodic Task Scheduling
UNDERSTANDING POST-ADOPTION OF ONLINE SHOPPING CONTINUANCE USAGE THROUGH THE SOCIAL EXCHANGE THEORY
An Optimized RAD51 Inhibitor That Disrupts Homologous Recombination without Requiring Michael Acceptor Reactivity
A Survey of Truth Discovery in Information Extraction
Got Annoyed? Examining the Advertising Effectiveness and Annoyance Dynamics
Computing Partitions with Applications to the Knapsack Problem