<--- Back to Details
First PageDocument Content
Mathematical optimization / Job shop scheduling / Business / Parallel computing / Data buffer / Applied mathematics / Operations research / Planning / Scheduling
Date: 2013-08-26 07:14:50
Mathematical optimization
Job shop scheduling
Business
Parallel computing
Data buffer
Applied mathematics
Operations research
Planning
Scheduling

Add to Reading List

Source URL: media.wiley.com

Download Document from Source Website

File Size: 685,09 KB

Share Document on Facebook

Similar Documents

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

DocID: 1uCRt - View Document

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

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

DocID: 1rrDA - View Document

Operations research / Scheduling / Mathematical optimization / Combinatorial optimization / Job shop scheduling / Mathematics / Mathematical analysis / Applied mathematics / Permutations

Microsoft Word - IBSAlgorithms.doc

DocID: 1rkGY - View Document

Scheduling / Operations research / Mathematics / Applied mathematics / Computer science / Makespan / Online algorithm / Job / Competitive analysis / Algorithm / Optimization problem / Job shop scheduling

239 Documenta Math. Ronald Graham: Laying the Foundations of Online Optimization

DocID: 1r1tq - View Document

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

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

DocID: 1qWKb - View Document