The asymptotic convergence of some flow-shop scheduling heuristics

Asia-Pacific Journal of Operational Research

Volumn 18, Issue 2, 2001, Pages 243-256

  Portougal, Victor ^a   Scott, John L ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Asymptotic convergence; Flow shop scheduling worst case analysis; Heuristics; Machine scheduling

Indexed keywords

ARTIFICIAL INTELLIGENCE; ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; EXPERT SYSTEMS; GENETIC ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

ASYMPTOTIC CONVERGENCE; FLOW-SHOP SCHEDULING;

HEURISTIC METHODS;

EID: 0035519003     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. Sequencing with earliness and tardiness penalties: A review
2. Machine sequencing via disjunctive graphs: An implicit enumeration algorithm
3. A vector-sum theorem and its application to improving flow-shop guarantees
4. Genetic algorithms and job-shop scheduling
5. An algorithm for solving the job-shop problem
6. Using permutation spaces in job-shop scheduling
7. Application of the branch and bound technique to some flow-shop problems
8. Discussion: Sequencing n jobs on two machines with arbitrary time lags
9. Heuristics for flow-shop scheduling problems minimizing mean tardiness
10. Job-shop scheduling by implicit enumeration
11. Recent developments in deterministic sequencing and scheduling: A survey
12. Asymptotic behavior of some scheduling algorithms
13. Scheduling heuristics for the n-job m-machine flow-shop
14. The application of a parallel genetic algorithm to the n/m/P/Cmax flow-shop problem
15. Some efficient heuristic methods for the flow-shop sequencing problem
16. A broader view of the job-shop scheduling problem
17. Job shop scheduling with tooling constraints: A Tabu search approach