A new and practical heuristic for Master Production Scheduling creation
暂无分享,去创建一个
[1] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[2] Jim Browne,et al. Master production scheduling: a concurrent planning approach , 1992 .
[3] Woodie C. Flowers,et al. A genetic algorithm for resource-constrained scheduling , 1996 .
[4] Jose A. Ventura,et al. Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times , 2000 .
[5] David Connolly. An improved annealing scheme for the QAP , 1990 .
[6] Ming Liang,et al. Comparative study of simulated annealing, genetic algorithms and tabu search for solving binary and comprehensive machine-grouping problems , 2002 .
[7] Michael McLaughlin. Simulated annealing , 1989 .
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] Guilherme E. Vieira,et al. A Practical View of the Complexity in Developing Master Production Schedules: Fundamentals, Examples, and Implementation , 2006 .
[10] Nick Brieger,et al. Production and operations , 1992 .
[11] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[12] L. Krajewski,et al. Operations Management , 1994 .
[13] E. Bonomi,et al. The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm , 1984 .
[14] Marilyn K. McClelland,et al. Order Promising and the Master Production Schedule , 1988 .