A Short-Term Scheduling Problem in the Paper-Converting Industry
暂无分享,去创建一个
[1] I. Grossmann,et al. MILP model for scheduling and design of a special class of multipurpose batch plants , 1996 .
[2] Frank Werner,et al. Insertion Techniques for the Heuristic Solution of the Job Shop Problem , 1995, Discret. Appl. Math..
[3] Nilay Shah,et al. Improving the efficiency of discrete time scheduling formulation , 1998 .
[4] Gordian Hansjoerg Schilling. Algorithms for short-term and periodic process scheduling and rescheduling , 1998 .
[5] William J. Cook,et al. A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.
[6] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[7] T. Westerlund,et al. Some Efficient Formulations for the Simultaneous Solution of Trim-Loss and Scheduling Problems in the Paper-Converting Industry , 1998 .
[8] Nikolaos V. Sahinidis,et al. Bridging the gap between heuristics and optimization: Capacity expansion case , 1997 .
[9] Christodoulos A. Floudas,et al. Short-term scheduling : New mathematical models vs algorithmic improvements , 1998 .