Local search heuristics for two-stage flow shop problems with secondary criterion

Computers and Operations Research

Volumn 29, Issue 2, 2001, Pages 123-149

  Gupta, Jatinder N D ^a   Hennig, Karsten ^b   Werner, Frank ^b  

^a BALL STATE UNIVERSITY   (United States)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Empirical evaluation; Flow shop scheduling; Local search; Multi level search; Secondary criterion; Simulated annealing; Tabu search; Threshold accepting

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

WEIGHTED FLOW TIME;

OPERATIONS RESEARCH;

MANUFACTURING; PRODUCTION SYSTEM;

EID: 0036027960     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00061-7     Document Type: Article

References (29)

1. Bicriterion static scheduling research for a single machine
2. A framework for single machine multiple objective sequencing research
3. Complexity of single machine hierarchical scheduling: A survey
4. Multiple and bicriteria scheduling: A literature survey
5. Sequencing and scheduling: Algorithms and complexity
6. Optimal two- and three-stage production schedules with set-up times included
7. The complexity of flow shop and job shop scheduling
8. Complexity results for multi-machine multi-criteria scheduling problems
9. Two-stage flow shop scheduling problem with bicriteria
10. Genetic algorithms for the two-stage bicriteria flow shop problem
11. Designing a tabu search algorithm for the two-stage flowshop problem with secondary criterion
12. Minimizing total flow time in a 2-machine flowshop problem with minimum makespan
13. A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
14. Heuristics for permutation flow shop scheduling with batch setup times
15. Equation of state calculations by fast computing machines
16. Optimization by simulated anncaling
17. Thermodynamical approach to the traveling salesman problem
18. Convergence of an annealing algorithm
19. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
20. A comparison of local search methods for flow shop scheduling
21. Tabu search
22. Large-step Markov chain for the TSP incorporating local search heuristics
23. Improving local search heuristics for some scheduling problems
24. Improving local search heuristics for some scheduling problems
25. Job-shop scheduling: Computational study of large-step optimization methods
26. The shifting bottleneck procedure for job shop scheduling