Flow shop scheduling with multiple objective of minimizing makespan and total flow time

International Journal of Advanced Manufacturing Technology

Volumn 25, Issue 9-10, 2005, Pages 1007-1012

  Ravindran, D ^a   Selvakumar, S J ^a   Sivaraman, R ^a   Haq, A Noorul ^b  

^a NATIONAL ENGINEERING COLLEGE   (India)

^b NATIONAL INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Flow shop scheduling; Flow time; Makespan; Multicriterion

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

FLOW SHOP SCHEDULING; HEURISTIC ALGORITHMS; MAKESPAN; MULTICRITERION;

SCHEDULING;

EID: 18144431039     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-003-1926-1     Document Type: Article

References (16)

1. Johnson SM (1954) Two and three stage production schedules with setup times included. Naval Res Logist Q 1:61-68
2. Ignall E, Schrage L (1965) Application of the branch and bound technique to some flow shop scheduling problems. Oper Res 13:400-412
3. Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n-job m-machine sequencing problem. Manage Sci 16(16):630-637
4. Nawaz M, Emory E, Ham I (1983) A heuristic algorithm for the m-machine, n-jobs flow shop sequencing problem. Omega 11:91-95
5. Ho JC, Chang YL (1976) A new heuristic for the n-jobs, m-machine flowshop scheduling. Math Oper Res 1:117-129
6. Chou F-D, Lee C-E (1999) Two-machine flowshop scheduling with bicriteria problem. Comput Ind Eng 36:549-564
7. Allahverdi A, Aldowaisan T (2000) No-wait and separate setup three-machine flow shops with total completion time criterion. Int Trans Oper Res 7:245-264
8. Jatinder ND, Venkata G, Neppalli R, Werner F (2001) Minimizing total flow time in a two-machine flowshop problem with minimum makespan. Int J Prod Econ 69:323-338
9. Gowrisankar K, Chandrasekharan, Rajendran, Srinivasan G (2001) Flow shop scheduling algorithm for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date. Eur J Oper Res 132:643-665
10. Rajendran C, Ziegler H (1997) An efficient heuristic for scheduling in flow shop to minimize total weighted flow time of jobs. Eur J Oper Res 103:129-138
11. Azizoglu M, Cakmark E, Kondakci S (2001) A flexible flowshop problem with total flow time minimization. Eur J Oper Res 132:528-538
12. I scheduling problems. Eur J Oper Res 132:439-452
13. Burdett RL, Kozan E (2000) Evolutionary algorithms for flowshop sequencing with non-unique jobs. Int Trans Oper Res 7:401-418
14. Rajendran C, Chaudhuri D (1992) An efficient heuristic approach to the scheduling of jobs in a flow shop. Eur J Oper Res 61:318-325
15. Rajendran C (1995) Heuristic for scheduling in flow shop with multiple objectives. Eur J Oper Res 82:540-555
16. Taillard E (1993) Benchmarks of basic scheduling problems. Eur J Oper Res 64:278-285