Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


ohiou1183424961.pdf (1.05 MB)

ETD Abstract Container

Abstract Header

MATHEMATICAL FORMULATION AND SCHEDULING HEURISTICS FOR CYCLIC PERMUTATION FLOW-SHOPS

Nambiar, Arun N
http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1183424961

Abstract Details

2007, Doctor of Philosophy (PhD), Ohio University, Integrated Engineering (Engineering).
Scheduling is a decision-making process that concerns the allocation of limited resources to a set of tasks with the view of optimizing one or more objectives. The primary focus of this work is the cyclic permutation flow-shop problem where a set of parts is repeatedly produced (cyclic) and the sequence of parts on all the machines remains the same (permutation). A mathematical formulation for the above problem is developed using max-plus algebra. A new concept called opportunities that identifies potential areas for improving the existing schedule is also presented. New heuristic approaches are proposed to find the optimal or sub-optimal solutions to the scheduling problem using the aforementioned mathematical formulation. The analysis of the results obtained using the developed heuristics and some of the existing heuristics on Taillard’s benchmark problems have shown that the developed heuristics produce solutions of better quality and incur significantly lower computation time than the existing heuristics that were investigated.
Robert Judd (Advisor)
169 p.
Engineering, Industrial
scheduling; flow-shop; max-plus; mathematical model

Recommended Citations

Citations

  • Nambiar, A. N. (2007). MATHEMATICAL FORMULATION AND SCHEDULING HEURISTICS FOR CYCLIC PERMUTATION FLOW-SHOPS [Doctoral dissertation, Ohio University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1183424961

    APA Style (7th edition)

  • Nambiar, Arun. MATHEMATICAL FORMULATION AND SCHEDULING HEURISTICS FOR CYCLIC PERMUTATION FLOW-SHOPS. 2007. Ohio University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1183424961.

    MLA Style (8th edition)

  • Nambiar, Arun. "MATHEMATICAL FORMULATION AND SCHEDULING HEURISTICS FOR CYCLIC PERMUTATION FLOW-SHOPS." Doctoral dissertation, Ohio University, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1183424961

    Chicago Manual of Style (17th edition)

ohiou1183424961
3,043
© 2007, all rights reserved.
This open access ETD is published by Ohio University and OhioLINK.