Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs

Computers and Operations Research

Volumn 28, Issue 9, 2001, Pages 835-852

  Lee, In ^a  

^a SETON HALL UNIVERSITY   (United States)

Author keywords

Genetic and tabu search; Heuristic; Sequencing

Indexed keywords

COMPUTATIONAL METHODS; GENETIC ALGORITHMS; OPERATIONS RESEARCH; SCHEDULING; SIMULATED ANNEALING;

ARTIFICIAL INTELLIGENCE SEARCH METHOD; NEIGHBORHOOD SEARCH METHOD; TABU SEARCH METHOD;

ARTIFICIAL INTELLIGENCE;

ARTIFICIAL INTELLIGENCE; MACHINERY; MANUFACTURING;

EID: 0035427271     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00011-3     Document Type: Article

References (30)

1. Scheduling tasks with due dates in a fabrication/assembly process
2. Optimal single-machine scheduling with earliness and tardiness penalties
3. Optimal cycle times in multistage serial systems with set-up and inventory costs
4. Optimal two and three-stage production schedules with setup times included
5. Sequencing jobs through a multistage process in the minimum total time - A quick method of obtaining a near optimum
6. A heuristic algorithm of the n job, m machine sequencing problem
7. A functional heuristic algorithm for the flow-shop scheduling problem
8. An evaluation of flowshop sequencing heuristics
9. Equation of state calculations by fast computing machines
10. Optimization by simulated annealing
11. Simulated annealing for permutation flow-shop scheduling
12. max flowshop problem
13. A controlled search simulated annealing method for the single machine weighted tardiness problem
14. Job shop scheduling with genetic algorithms
15. Using genetic algorithms to schedule flow shop releases
16. The application of genetic algorithms to resource scheduling
17. A study of permutation crossover operators on the traveling salesman problem
18. Scheduling problems and traveling salesman
19. A genetic algorithm-based approach to flexible flow-line scheduling
20. Tabu search - Part I
21. Tabu search - Part II
22. Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
23. Applying tabu search to the job-shop scheduling problem
24. Some efficient heuristic methods for the flow shop sequencing problem
25. Parallel taboo search techniques for the job shop scheduling problem