A heuristic approach to batching and scheduling a single machine to minimize setup costs
暂无分享,去创建一个
[1] Klaus H. Ecker,et al. Scheduling Computer and Manufacturing Processes , 2001 .
[2] Christopher S. Tang,et al. Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants , 1988, Oper. Res..
[3] V. G. Timkovskii. Complexity of common subsequence and supersequence problems and related problems , 1989 .
[4] Mansour E. Abou Gamila,et al. A modeling technique for loading and scheduling problems in FMS , 2003 .
[5] Cheng-Jung Lin,et al. Optimal operation planning and sequencing: minimization of tool changeovers , 1993 .
[6] Kathryn E. Stecke,et al. A study of FMS part type selection approaches for short-term production planning , 1988 .
[7] Alessandro Agnetis,et al. Part Batching and Scheduling in a Flexible Cell to Minimize Setup Costs , 2003, J. Sched..
[8] Jatinder N. D. Gupta,et al. A review of scheduling research involving setup considerations , 1999 .
[9] Christopher S. Tang,et al. Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches , 1988, Oper. Res..
[10] David Maier,et al. The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.
[11] Ming Liang,et al. Solving the combined part sequencing and tool replacement problem for an automated machining center: a tabu search approach , 1995 .
[12] Viliam Makis,et al. Scheduling of the optimal tool replacement times in a flexible manufacturing system , 2001 .