Name
Title | ||
|---|---|---|
Flow shop scheduling for separation model of set-up and net process based on Branch-and-Bound method |
Abstract | ||
|---|---|---|
Lots of research reports on flow shop scheduling problems have been reported. Generally speaking, these models are applicable to a simple model with no separation of set-up processes and net ones. In many production lines, we cannot ignore the set-up times in comparison with the net processing times. We can expect to shorten the total processing time by executing the set-up processes and net ones in parallel. We need a parallel operation model to improve schedule results. We will propose a new scheduling method for multi-stage flow shops. The aim of the method is to shorten the total processing time by operating the set-up processes and the net ones of each job in parallel. We applied the Branch-and-Bound method and developed a new calculation algorithm for the lower bound estimation of the total processing time. Finally, we will evaluate our proposed method by some numerical experiments using actual production line data. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.cie.2008.08.004 | Computers & Industrial Engineering |
Keywords | Field | DocType |
parallel operation model,processing time,flow shop scheduling problem,flow shop scheduling,set-up process,total processing time,branch-and-bound method,new scheduling method,separation model,actual production line data,set-up time,lower bound | Mathematical optimization,Scheduling (computing),Computer science,Upper and lower bounds,Flow (psychology),Flow shop scheduling,Production line,Branch and bound method,Operations management | Journal |
Volume | Issue | ISSN |
57 | 2 | Computers & Industrial Engineering |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kenzo Kurihara | 1 | 7 | 5.23 |
| Yann-Liang Li | 2 | 0 | 0.34 |
| Nobuyuki Nishiuchi | 3 | 18 | 7.82 |
| Kazuaki Masuda | 4 | 7 | 4.21 |