<--- Back to Details
First PageDocument Content
Applied mathematics / Scheduling / Planning / Job shop scheduling / Theoretical computer science / Flow Shop Scheduling Problem / Sequence-dependent setup / Permutation / Genetic algorithm / Operations research / Mathematical optimization / Mathematics
Date: 2006-10-10 12:26:33
Applied mathematics
Scheduling
Planning
Job shop scheduling
Theoretical computer science
Flow Shop Scheduling Problem
Sequence-dependent setup
Permutation
Genetic algorithm
Operations research
Mathematical optimization
Mathematics

Flowshop Scheduling Problem ­ Introduction The challenge has as focus the PERMUTATION FLOWSHOP PROBLEM, in the  MONO­OBJECTIVE case, the objective function to be minimized being the overall 

Add to Reading List

Source URL: www.lifl.fr

Download Document from Source Website

File Size: 658,46 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

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

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

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

DocID: 1rrDA - View Document

Microsoft Word - IBSAlgorithms.doc

Microsoft Word - IBSAlgorithms.doc

DocID: 1rkGY - View Document

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

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

DocID: 1r1tq - View Document

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

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