Minimizing flow time in a flow-line manufacturing cell with family setup times

Journal of the Operational Research Society

Volumn 57, Issue 2, 2006, Pages 163-176

  Gupta, J N D ^a   Schaller, J E ^b  

^a UNIVERSITY OF ALABAMA IN HUNTSVILLE   (United States)

^b EASTERN CONNECTICUT STATE UNIVERSITY   (United States)

Author keywords

Empirical results; Family setups; Flowshop scheduling; Heuristic algorithms; Lower bounds; Manufacturing cells

Indexed keywords

ALGORITHMS; CELLULAR MANUFACTURING; HEURISTIC METHODS; INDUSTRIAL MANAGEMENT; JOB ANALYSIS; MACHINE SHOP PRACTICE; OPERATIONS RESEARCH; PROBLEM SOLVING;

FAMILY SETUPS; FLOWSHOP SCHEDULING; HEURISTIC ALGORITHMS; LOWER BOUNDS;

SCHEDULING;

EID: 31444449761     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601971     Document Type: Article

References (17)

1. Potts CN and Van Wassenhove LN (1992). Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J Opl Res Soc 43: 395-406.
2. Allahverdi A, Gupta JND and Aldowaisan T (1999). A review of scheduling research involving setup considerations. OMEGA 27: 219-239.
3. Yang WH and Liao CJ (1999). Survey of scheduling research involving setup times. Int J Syst Sci 30: 143-155.
4. Cheng TCE, Gupta JND and Wang G (2000). A review of flowshop scheduling research with setup times. Prod Opns Mngt 9: 283-302.
5. Sridhar J and Rajendran C (1994). A genetic algorithm for family and job scheduling in a flowline-based manufacturing cell. Comput M Eng 27: 469-472.
6. Vakharia AJ and Chang YL (1990). A simulated annealing approach to scheduling a manufacturing cell. Naval Res Logist 37: 559-577.
7. Brown SI, McGarvey RG and Ventura JA (2004). Total flowtime and makespan for a no-wait m-machine flowshop with setup times separated. J Opl Res Soc 55: 614-621.
8. Ham I, Hitomi K and Yoshida T (1985). Group Technology. Kluwer-Nijhoff Publishing: Boston.
9. Bansal SP (1977). Minimizing the sum of completion times of n-jobs over M-machines in a flowshop - a branch and bound approach. AIIE Trans 9: 306-311.
10. Rajendran C and Chaudhuri D (1991). An efficient heuristic approach to the scheduling of jobs in a flowshop. Eur J Opl Res 61: 318-325.
11. Nawaz M, Enscore E and Ham I (1983). A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA 11:91-95.
12. Taillard E (1990). Some efficient heuristic methods for the flowshop sequencing problem. Eur J Opl Res 47: 65-74.
13. Etiler O, Toklu B, Atak M and Wilson J (2004). A genetic algorithm for flow shop scheduling problems. J Opl Res Soc 55: 830-835.
14. Framinan JM, Gupta JND and Leisten R (2004). A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J Opl Res Soc 55: 1243-1255.
15. Wemmerlov U and Vakharia AJ (1991). Job and family scheduling of a flow-line manufacturing cell: a simulation study. IIE Trans 23: 383-393.
16. Skorin-Kapov J and Vakharia AJ (1993). Scheduling a flow-line manufacturing cell: a tabu search approach. Int J Prod Res 31: 1721-1734.
17. Schaller JE (2000). A comparison of heuristics for family and job scheduling in a flow-line manufacturing cell. Int J Prod Res 38:287-308.