Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Tami Tami
Minimizing Makespan and Preemption Costs on a System of Uniform Machines
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Flow Shop Scheduling Problem With Four Machines N-Job for Minimizing Makespan
International Journal of Engineering Research and
Minimizing Worst-Case and Average-Case Makespan Over Scenarios
Journal of Scheduling
Management Science
Engineering
Operations Research
Artificial Intelligence
Software
Minimizing Energy Consumption and Makespan in a Two-Machine Flowshop Scheduling Problem
Journal of the Operational Research Society
Management
Probability
Marketing
Uncertainty
Simulation
Management Science
Statistics
Management Information Systems
Modeling
Strategy
Operations Research
Minimizing Expected Makespans on Uniform Processor Systems
Advances in Applied Probability
Applied Mathematics
Statistics
Probability
Heuristic Procedures for Minimizing Makespan and the Number of Required Pallets
European Journal of Operational Research
Information Systems
Simulation
Management Science
Management
Computer Science
Modeling
Operations Research
Hierarchy-Based Algorithms for Minimizing Makespan Under Precedence and Communication Constraints
Optimal On-Line Algorithms to Minimize Makespan on Two Machines With Resource Augmentation
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Memetic Algorithm for Minimizing the Makespan in the Job Shop Scheduling Problem
Revista Facultad de Ingeniería
Erratum To: Minimizing Total Tardiness on Parallel Machines With Preemptions
Journal of Scheduling
Management Science
Engineering
Operations Research
Artificial Intelligence
Software
