최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기Theoretical computer science, v.657 pt.A, 2017년, pp.64 - 72
Dong, J. , Tong, W. , Luo, T. , Wang, X. , Hu, J. , Xu, Y. , Lin, G.
We consider the NP-hard m-parallel two-stage flowshop problem, abbreviated as the (m,2)-PFS problem, where we need to schedule n jobs to m parallel identical two-stage flowshops in order to minimize the makespan, i.e. the maximum completion time of all the jobs on the m flowshops. The (m,2)-PFS prob...
J. Oper. Res. Soc. Chen 46 234 1995 10.1057/jors.1995.28 Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage
Oper. Res. Chen 44 891 1996 10.1287/opre.44.6.891 A new heuristic for three-machine flow shop scheduling
Conway 1967 Theory of Scheduling
Garey 1979 Computers and Intractability: A Guide to the Theory of NP-Completeness
Math. Oper. Res. Garey 1 117 1976 10.1287/moor.1.2.117 The complexity of flowshop and jobshop scheduling
Oper. Res. Gonzalez 26 36 1978 10.1287/opre.26.1.36 Flowshop and jobshop schedules: complexity and approximation
J. Oper. Res. Soc. Gupta 39 359 1988 10.1057/jors.1988.63 Two-stage, hybrid flowshop scheduling problem
Int. J. Prod. Res. Gupta 29 1489 1991 10.1080/00207549108948025 Schedules for a two-stage hybrid flowshop with parallel machines at the second stage
Math. Program. Hall 82 175 1998 10.1007/BF01585870 Approximability of flow shop scheduling
IIE Trans. He 28 129 1996 10.1080/07408179608966258 A scheduling problem in glass manufacturing
J. ACM Hochbaum 34 144 1987 10.1145/7531.7535 Using dual approximation algorithms for scheduling problems theoretical and practical results
Jansen vol. 1770 455 2000 STACS Polynomial time approximation schemes for the multiprocessor open and flow shop scheduling problem
Nav. Res. Logist. Q. Johnson 1 61 1954 10.1002/nav.3800010110 Optimal two- and three-stage production schedules with setup times included
Oper. Res. Lett. Lee 16 149 1994 10.1016/0167-6377(94)90026-4 Minimizing makespan in hybrid flowshops
European J. Oper. Res. Ruiz 205 1 2010 10.1016/j.ejor.2009.09.024 The hybrid flow shop scheduling problem
J. ACM Sahni 23 116 1976 10.1145/321921.321934 Algorithms for scheduling independent tasks
Theoret. Comput. Sci. Schuurman 237 105 2000 10.1016/S0304-3975(98)00157-1 A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
IIE Trans. Vairaktarakis 32 687 2000 10.1080/07408170008967427 The use of flowlines to simplify routing complexity in two-stage flowshops
Expert Syst. Wang 22 78 2005 10.1111/j.1468-0394.2005.00297.x Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions
Oper. Res. Williamson 45 288 1997 10.1287/opre.45.2.288 Short shop schedules
European J. Oper. Res. Zhang 216 544 2012 10.1016/j.ejor.2011.08.007 Approximation algorithms for the parallel flow shop problem
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
저자가 APC(Article Processing Charge)를 지불한 논문에 한하여 자유로운 이용이 가능한, hybrid 저널에 출판된 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.