A New Algorithm for Large Scale Scheduling Problems: Sequence Branch Algorithm

Mixed integer linear programming based methods have been widely employed but have been limited to problems with simple recipes or small-scale scheduling problems. This paper proposes the sequence branch algorithm (SBA) that can handle large-scale complex scheduling problems for batch processes under unlimited intermediate storage policy. The SBA generates the schedule tree in which all feasible schedules are included. A heuristic function is employed to accelerate the searching speed and it causes the results somewhat deviated from the optimal solution. The efficiency of the proposed algorithm is illustrated through complex and large-scale problems including a case study of a semiconductor fabrication process.
Publisher
Amer Chemical Soc
Issue Date
1998-01
Language
ENG
Keywords

PERFORMANCE EVALUATION; PETRI NETS; PLANTS; TIME

Citation

INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, v.37, no.10, pp.4049 - 4059

ISSN
0888-5885
DOI
10.1021/ie980103e
URI
http://hdl.handle.net/10203/74718
Appears in Collection
CBE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 137
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 2 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0