Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
暂无分享,去创建一个
[1] T. C. Edwin Cheng,et al. An exact algorithm for batching and scheduling two part types in a mixed shop: A technical note , 1998 .
[2] Tadashi Kurisu. TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS , 1976 .
[3] Jatinder N. D. Gupta,et al. Flowshop scheduling with dominant machines , 1995, Comput. Oper. Res..
[4] Giovani J.C. da Silveira,et al. Mass customization: Literature review and research directions , 2001 .
[5] Gur Mosheiov,et al. Multi-Machine Scheduling With Linear Deterioration , 1998 .
[6] Vitaly A. Strusevich,et al. The open shop scheduling problem with a given sequence of jobs on one machine , 1998 .
[7] S. S. Panwalkar,et al. The Lessons of Flowshop Scheduling Research , 1992, Oper. Res..
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] Bertrand M. T. Lin,et al. Two-stage flowshop scheduling with a common second-stage machine , 1997, Comput. Oper. Res..
[10] Bertrand M. T. Lin,et al. Johnson's rule, composite jobs and the relocation problem , 2009, Eur. J. Oper. Res..
[11] Gur Mosheiov,et al. Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job" , 2004, Eur. J. Oper. Res..
[12] Richard J. Linn,et al. Hybrid flow shop scheduling: a survey , 1999 .
[13] Jaideep Motwani,et al. Flowshop scheduling/sequencing research: a statistical review of the literature, 1952-1994 , 1997 .
[14] Christos Koulamas,et al. Flow shop and open shop scheduling with a critical machine and two operations per job , 2000, Eur. J. Oper. Res..
[15] Jeffrey B. Sidney,et al. The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations , 1979, Oper. Res..
[16] Clyde L. Monma. The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions , 1979, Oper. Res..
[17] Bertrand M. T. Lin,et al. A note on parallel-machine scheduling with deteriorating jobs , 2007, J. Oper. Res. Soc..
[18] Bertrand M. T. Lin. The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine , 1999, Comput. Oper. Res..
[19] Bertrand M. T. Lin. Complexity results for single-machine scheduling with positional learning effects , 2007, J. Oper. Res. Soc..
[20] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[21] Ammar Oulamara,et al. Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times , 2008 .
[22] Vitaly A. Strusevich,et al. Heuristics for the two-stage job shop scheduling problem with a bottleneck machine , 2000, Eur. J. Oper. Res..
[23] Philip M. Kaminsky,et al. Designing and managing the supply chain : concepts, strategies, and case studies , 2007 .