A partial enumeration heuristic for multi-objective flowshop scheduling problems

Journal of the Operational Research Society

Volumn 55, Issue 9, 2004, Pages 1000-1007

  Arroyo, J E C ^a   Armentano, V A ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Combinatorial optimization; Flowshop scheduling; Heuristic; Multi objective optimization

Indexed keywords

DECISION MAKING; HEURISTIC METHODS; MANAGEMENT SCIENCE; OPTIMIZATION; PRODUCTION ENGINEERING; SCHEDULING;

COMBINATORIAL OPTIMIZATION; FLOWSHOP SCHEDULING; MULTI OBJECTIVE OPTIMIZATION;

OPERATIONS RESEARCH;

EID: 4344592872     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601746     Document Type: Article

References (31)

1. Panwalkar SS, Dudek RA and Smith ML (1973). Sequencing research and the industrial scheduling problem. In: Elmaghraby SE (eds) Symposium on the Theory of Scheduling and its Applications. Springer, Berlin.
2. Ehrgott M and Gandibleux X (2000). A survey and annotated bibliography of multicriteria combinatorial optimization. OR Spektrum 22: 425-460.
3. T'kindt V and Billaut J-C (2001). Multicriteria scheduling problems: a survey. RAIRO Opns Res 35: 143-163.
4. Sridhar J and Rajendran C (1996). Scheduling in flowshop and cellular manufacturing systems with multiple objectives a genetic algorithm approach. Prod Planning Control 1: 374-382.
5. Chakravarthy K and Rajendran C (1999). A heuristic for scheduling in a fiowshop with the bicriteria of makespan and maximum tardiness minimization. Prod Planning Control 10: 707-714.
6. Rajendran C and Ziegler H (2003). Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. Eur J Opns Res 149: 513-522.
7. Allahverdi A (2001). The tricriteria two-machine flowshop scheduling problem, Int Trans Opl Res 8: 403-425.
8. Allahverdi A (2003). The two and m machines flowshop scheduling problems with bicriteria of makespan and mean flowtime. Eur J Opns Res 147: 373-396.
9. Allahverdi A (2004). A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. Comput Opns Res 31: 157-180.
10. Gupta JND, Palanimuthu N and Chen CL (1999). Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion. Prod Planning Control 10: 251-265.
11. Gupta JND, Hennig K and Werner F (2000). Local search heuristics for two-stage flow shop problems with secondary criterion. Comput Opns Res 29: 123-149.
12. Gupta JND, Neppalli VR and Werner F (2000). Minimizing total flow time in a two-machine flowshop problem with minimum makespan. Int J Prod Econ 69: 323-338.
13. Daniels RL and Chambers RJ (1990). Multiobjective flow-shop scheduling. Naval Res Logist 37: 981-995.
14. Liao CJ, Yu WC and Joe CB (1997). Bicriterion scheduling in the two-machine flowshop. J Opl Res Soc 48: 929-935.
15. Sayin S and Karabati S (1999). A bicriteria approach to the two-machine flow shop scheduling problem. Eur J Opns Res 113: 435-449.
16. Framinan JM, Leisten R and Ruiz-Usano R (2002). Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimization. Eur J Opns Res 141: 559-569.
17. Murata T, Ishibuchi H and Tanaka H (1996). Multi-objective genetic algorithm and its applications to flowshop scheduling. Comput Ind Engng 30: 957-968.
18. Ishibuchi H and Murata T (1998). A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Systems Man Cybernet, Part C Appl Rev 28: 392-403.
19. Murata T, Ishibuchi H and Gen M (2001). Specification of genetic search directions in cellular multi-objective genetic algorithms. In: Zitzler E, Deb K, Thiele L, Coello CAC and Corne D (eds). Evolutionary Multi-Criterion Optimization. First International Conference, EMO 2001, Zurich, Switzerland, Lecture Notes in Computer Science 1993. Springer, Berlin, pp. 82-95.
20. Jones DS, Mirrazavi and Tamis M (2002). Multi-objective meta heuristics: an overview of the current state-of-the-art. Eur J Opns Res 137: 1-9.
21. Nawaz M, Enscore EE and Ham I (1983), A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. Omega 11: 91-98.
22. Armentano VA and Ronconi DP (1999). Tabu search for total tardiness minimization in flowshop scheduling problems. Comput Opns Res 26: 219-235,.
23. Arroyo JEC (2002). Heuristicas e Metaheurísticas para Otimização Combinatória Multiobjetivo. Doctoral thesis, Faculdade de Engenharia Elétrica e de Computação, Universidade Estadual de Campinas, Brazil (in Portuguese).
24. Baker KR and Kanet JJ (1983). Job shop scheduling with modified due dates. J Opns Mngt Sci 4: 11-22.
25. Holthaus O and Rajendran C (1997). Efficient dispatching rules for scheduling in a job shop. Int J Prod Econ 48: 87-105.
26. Holthaus O and Rajendran C (2000). Efficient jobshop dispatching rules: further developments. Prod Planning Control 11: 171-178.
27. Johnson SM (1954). Optimal two- and three-stage production schedules with set-up times included. Naval Res Logist Q 1: 61-68.
28. Taillard E (1993). Benchmarks for basic scheduling problems. Eur J Opns Res 64: 278-285.
29. Hansen MP and Jaszkiewicz A (1998). Evaluating the quality of approximations to the nandominated set. Technical Report, Institute of Mathematical Modeling, Technical University of Denmark.
30. Czyzak P and Jaszkiewicz A (1998). Pareto simulated annealing - a metaheuristic technique for multiple objective combinatorial optimization. J Multi-Criteria Decis Anal 7: 34-47.
31. Ulungu EL, Teghem J and Ost Ch (1998). Efficiency of interactive multi-objective simulated annealing through a case study. J Opl Res Soc 49: 1044-1050.