<--- Back to Details
First PageDocument Content
Scheduling / Operations research / Applied mathematics / Mathematics / Makespan / Algorithm / Online algorithm / Economy / Job shop scheduling / Flow shop scheduling
Date: 2013-11-25 11:05:06
Scheduling
Operations research
Applied mathematics
Mathematics
Makespan
Algorithm
Online algorithm
Economy
Job shop scheduling
Flow shop scheduling

Scheduling with Unexpected Machine Breakdowns Susanne Albers Gunter Schmidty Abstract

Add to Reading List

Source URL: www14.in.tum.de

Download Document from Source Website

File Size: 224,96 KB

Share Document on Facebook

Similar Documents

A Java Framework for (Online) Algorithm Selection With Use Case on the Generalized Assignment Problem Hans Degroote1, José Luis González Velarde² and Patrick De Causmaecker1 1KU Leuven Department of Computer Science -

A Java Framework for (Online) Algorithm Selection With Use Case on the Generalized Assignment Problem Hans Degroote1, José Luis González Velarde² and Patrick De Causmaecker1 1KU Leuven Department of Computer Science -

DocID: 1vjco - View Document

International Journal of Computer Science and Software Engineering (IJCSSE), Volume 6, Issue 7, July 2017 ISSN (Online): www.IJCSSE.org Page: A Modified Simplified Data Encryption Standard Algorithm

International Journal of Computer Science and Software Engineering (IJCSSE), Volume 6, Issue 7, July 2017 ISSN (Online): www.IJCSSE.org Page: A Modified Simplified Data Encryption Standard Algorithm

DocID: 1uAKb - View Document

Online Algorithm Selection Hans Degroote1, Bernd Bischl2, Lars Kotthoff3 and Patrick De Causmaecker1 1KU Leuven, Department of Computer Science - CODeS & imec-ITEC 2Department of Statistics, LMU Munich

Online Algorithm Selection Hans Degroote1, Bernd Bischl2, Lars Kotthoff3 and Patrick De Causmaecker1 1KU Leuven, Department of Computer Science - CODeS & imec-ITEC 2Department of Statistics, LMU Munich

DocID: 1uxhy - View Document

An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation David Anderson * 1 Ming Gu * 1  Abstract

An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation David Anderson * 1 Ming Gu * 1 Abstract

DocID: 1tG55 - View Document

A Relaxed Algorithm for Online Matrix Inversion Arne Storjohann  Shiyun Yang

A Relaxed Algorithm for Online Matrix Inversion Arne Storjohann Shiyun Yang

DocID: 1tr7i - View Document