Performance guarantees for flowshop heuristics to minimize makespan
Article Abstract:
A study is conducted by comparing performance ratios of flowshop heuristic algorithms to analyze the performance guarantee of these algorithms to minimize makespan.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
A note on makespan minimization in two-stage flexible flow shops with uniform machines
Article Abstract:
The makespan minimization concept for managing flow-shop scheduling in uniform production systems is presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches. Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
- Abstracts: Makespan minimization on uniform parallel machines with release times. Concurrent flowshop scheduling to minimize makespan
- Abstracts: Bayesian network classifiers for identifying the slope of the customer lifecycle of long-life customers. Predicting online-purchasing behavior