论文信息 - Multiple Exchanges of Job Orders for No Buffer Job Shop Scheduling Problem (Identification of Jobs to be Changed on Gantt Chart) - 字舞流文

Multiple Exchanges of Job Orders for No Buffer Job Shop Scheduling Problem (Identification of Jobs to be Changed on Gantt Chart)

Takehiro Hayasaka | Eiji Shamoto | Rei Hino | E. Shamoto | R. Hino | Takehiro Hayasaka

[1] Heinz Gröflin,et al. A new neighborhood and tabu search for the Blocking Job Shop , 2009, Discret. Appl. Math..

[2] Erhan Kozan,et al. Scheduling a flow-shop with combined buffer conditions , 2009 .

[3] Peter Brucker,et al. Job-shop scheduling with limited capacity buffers , 2006, OR Spectr..

[4] Dario Pacciarelli,et al. Job-shop scheduling with blocking and no-wait constraints , 2002, Eur. J. Oper. Res..

[5] Chelliah Sriskandarajah,et al. A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[6] Egon Balas,et al. Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[7] Takehiro Hayasaka,et al. Multiple Exchanges of Job Orders for No-Buffer Job Shop Scheduling Problem , 2012 .