Hardness of Approximating Flow and Job Shop Scheduling Problems MONALDO MASTROLILLI, IDSIA, Lugano, Switzerland OLA SVENSSON, EPFL, Switzerland 20 We consider several variants of the job shop problem that is a fundamenta

Source URL: theory.epfl.ch

Improved Bounds for Flow Shop Scheduling Monaldo Mastrolilli and Ola Svensson IDSIA – Switzerland {monaldo,ola}@idsia.ch Abstract. We resolve an open question raised by Feige & Scheideler by showing that the best known

Source URL: theory.epfl.ch

Radboud Universiteit Nijmegen Master Thesis Mathematics Scheduling with job dependent machine speed

Source URL: www.math.ru.nl

• Economy
• Business
• Scheduling
• Operations research
• Theoretical computer science
• Manufacturing
• Planning
• Notation for theoretic scheduling problems
• Single-machine scheduling
• Algorithm
• Job shop scheduling
• Flow shop scheduling

Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Theory of computation
• Analysis of algorithms
• Operations research
• Scheduling
• Algorithm
• Mathematical logic
• Theoretical computer science
• Time complexity
• NC
• Job shop scheduling

Scheduling with Unexpected Machine Breakdowns Susanne Albers Gunter Schmidty Abstract

Source URL: www14.in.tum.de

• Scheduling
• Operations research
• Applied mathematics
• Mathematics
• Makespan
• Algorithm
• Online algorithm
• Economy
• Job shop scheduling
• Flow shop scheduling

1 Resource Speed Optimization for Two-Stage Flow-Shop Scheduling Alessandra Melani∗ , Renato Mancuso† , Daniel Cullina† , Marco Caccamo† , Lothar Thiele‡ ∗ Scuola Superiore Sant’Anna, Pisa, Italy, alessand

Source URL: www.tik.ee.ethz.ch

• Scheduling
• Operations research
• Computing
• Makespan
• Job
• Algorithm
• Parallel computing
• Software
• Applied mathematics

version 22 juin (AY) pour affichage.xlsx

Source URL: mim2016.utt.fr

• Business
• Economy
• Manufacturing
• Management
• Information technology management
• Operations research
• Production economics
• Manufacturing resource planning
• Scheduling
• Flow shop scheduling
• Systems engineering
• Logistics

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

Sponzors DIMATIA Program committee Nikhil Bansal, IBM Watson Research Center Sanjoy Baruah, University of North Carolina

Source URL: iti.mff.cuni.cz

• Scheduling
• Operations research
• Mathematical optimization
• Planning
• Multiprocessor scheduling
• Flow shop scheduling
• Interval scheduling
• Schedule
• Online algorithm
• Aging
• Genetic algorithm
• David Shmoys

CME 305: Discrete Mathematics and Algorithms Instructor: Professor Amin Saberi () Midterm – Problem 1. Show that a graph has a unique minimum spanning tree if, for every cut of the graph, th

Source URL: stanford.edu

• Combinatorial optimization
• Minimum spanning tree
• Spanning tree
• Job shop scheduling
• Maximum flow problem
• Max-flow min-cut theorem
• Cut
• Connectivity
• David Shmoys
• Graph theory
• Mathematics
• Theoretical computer science