Special Issue on Artificial Intelligence Underpinning Golden Ball Algorithm for solving Flow Shop Scheduling Problem Fatima Sayoti, Mohammed Essaid Riffi LAROSERI Laboratory, Dept. of Computer Science, Faculty of Scienc

Source URL: www.ijimai.org

• Operations research
• Computational complexity theory
• Scheduling
• Mathematics
• Applied mathematics
• NP-hard problems
• Complexity classes
• Mathematical optimization
• Flow shop scheduling
• Makespan
• Combinatorial optimization
• Schedule

11. A PPROXIMATION A LGORITHMS ‣ load balancing ‣ center selection ‣ pricing method: vertex cover ‣ LP rounding: vertex cover ‣ generalized load balancing

Source URL: vigna.di.unimi.it

• Scheduling
• Operations research
• NP-complete problems
• Complexity classes
• Combinatorial optimization
• Makespan
• Knapsack problem
• NP
• Algorithm
• Vertex cover
• Approximation algorithm
• Job shop scheduling

Chapter 9 Makespan Scheduling In this chapter, we consider the classical Makespan Scheduling problem. We are given m machines for scheduling, indexed by the set M = {1, . . . , m}. There are furthermore given n jobs, in

Source URL: www2.informatik.hu-berlin.de

SOP TRANSACTIONS ON APPLIED MATHEMATICS Accepted version, see http://www.scipublish.com/journals/AM/papers/1097 for published version. Approximation Algorithms for Subclasses of the Makespan Problem on Unrelated Parallel

Source URL: drpage.pagewizardgames.com

• Mathematical optimization
• Operations research
• Complexity classes
• Structural complexity theory
• Job shop scheduling
• NP
• Algorithm
• Time complexity
• Approximation algorithm
• Theoretical computer science
• Applied mathematics
• Computational complexity theory

A Robust PTAS for Machine Covering and Packing! Martin Skutella and Jos´e Verschae Institute of Mathematics, TU Berlin, Germany {skutella,verschae}@math.tu-berlin.de Abstract. Minimizing the makespan or maximizing the m

Source URL: page.math.tu-berlin.de

• Operations research
• Approximation algorithms
• Complexity classes
• Polynomial-time approximation scheme
• Job shop scheduling
• Bin packing problem
• Time complexity
• Linear programming
• David Shmoys
• Theoretical computer science
• Computational complexity theory
• Applied mathematics