Zagadnienie przepływowe z ograniczeniami "bez magazynowania". Algorytm tabu search z multiruchami
暂无分享,去创建一个
[1] Chelliah Sriskandarajah,et al. A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..
[2] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[3] Michael Pinedo,et al. Sequencing in an Assembly Line with Blocking to Minimize Cycle Time , 1989, Oper. Res..
[4] Tapan P. Bagchi,et al. Minimizing makespan in a blocking flowshop using genetic algorithms , 2001 .
[5] Eugeniusz Nowicki,et al. The permutation flow shop with buffers: A tabu search approach , 1999, Eur. J. Oper. Res..
[6] R. Gomory,et al. Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .
[7] Débora P. Ronconi,et al. Lower bounding schemes for flowshops with blocking in-process , 2001, J. Oper. Res. Soc..
[8] Józef Grabowski,et al. Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..
[9] Mieczysław Wodecki,et al. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..
[10] Débora P. Ronconi,et al. A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking , 2005, Ann. Oper. Res..
[11] Débora P. Ronconi,et al. A note on constructive heuristics for the flowshop problem with blocking , 2004 .
[12] Rainer Leisten,et al. Flowshop sequencing problems with limited buffer storage , 1990 .
[13] Chelliah Sriskandarajah,et al. Minimizing Cycle Time in a Blocking Flowshop , 2000, Oper. Res..