We propose in this paper a method to minimize the makespan of a set of jobs in a no-wait jobshop where transports are made by a hoist. Two heuristics are provided to transform the scheduling problem into a sequencing problem which is solved by a simulated annealing method. Heuristics are aimed to determine entry dates, that meet the no-wait constraints, for each sequence of jobs. This approach is tested and compared with Rajendran's heuristic in the case of no-wait flowshop and yields quite good results.
机构:
AN EL Anahtar & Elekt Ev Aletleri Sanayi AS, TR-34896 Istanbul, Turkiye
Marmara Univ, Inst Pure & Appl Sci, Ind Engn Doctorate Programme, TR-34722 Istanbul, TurkiyeAN EL Anahtar & Elekt Ev Aletleri Sanayi AS, TR-34896 Istanbul, Turkiye
Karacan, Ismet
Senvar, Ozlem
论文数: 0引用数: 0
h-index: 0
机构:
Marmara Univ, Dept Ind Engn, TR-34854 Istanbul, TurkiyeAN EL Anahtar & Elekt Ev Aletleri Sanayi AS, TR-34896 Istanbul, Turkiye
Senvar, Ozlem
Bulkan, Serol
论文数: 0引用数: 0
h-index: 0
机构:
Marmara Univ, Dept Ind Engn, TR-34854 Istanbul, TurkiyeAN EL Anahtar & Elekt Ev Aletleri Sanayi AS, TR-34896 Istanbul, Turkiye