Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
暂无分享,去创建一个
[1] Federico Della Croce,et al. A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem , 2002, J. Oper. Res. Soc..
[2] Bruce T. Lowerre,et al. The HARPY speech recognition system , 1976 .
[3] Stephen F. Smith,et al. Viewing scheduling as an opportunistic problem-solving process , 1988 .
[4] Ching-Jong Liao,et al. An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups , 2007, Comput. Oper. Res..
[5] Michael Pinedo,et al. Scheduling jobs on parallel machines with sequence-dependent setup times , 1997, Eur. J. Oper. Res..
[6] Roberto Tadei,et al. Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems , 2004, J. Heuristics.
[7] Tapan Sen,et al. Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey , 2003 .
[8] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[9] Jorge M. S. Valente,et al. Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time , 2005, Comput. Ind. Eng..
[10] Peter Brucker,et al. Scheduling Algorithms , 1995 .
[11] S. S. Panwalkar,et al. Sequencing Research and the Industrial Scheduling Problem , 1973 .
[12] Jon K. Wilbrecht,et al. The Influence of Setup Time on Job Shop Performance , 1969 .
[13] Thomas E. Morton,et al. The single machine early/tardy problem , 1989 .
[14] Chris N. Potts,et al. A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..
[15] Ram Rachamadugu,et al. Real-time scheduling of an automated manufacturing center * , 1989 .
[16] Steven Michael Rubin,et al. The argos image understanding system. , 1978 .
[17] Jatinder N. D. Gupta,et al. A review of scheduling research involving setup considerations , 1999 .
[18] Michael Pinedo,et al. A heuristic to minimize the total weighted tardiness with sequence-dependent setups , 1997 .
[19] Chris N. Potts,et al. Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach , 2005, Eur. J. Oper. Res..
[20] Vincent T'Kindt,et al. A recovering beam search algorithm for the single machine Just-in-Time scheduling problem , 2006, Eur. J. Oper. Res..
[21] Salah E. Elmaghraby,et al. Symposium on the Theory of Scheduling and Its Applications , 1973 .
[22] Stephen F. Smith,et al. Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics , 2005, J. Heuristics.
[23] P. Ow,et al. Filtered beam search in scheduling , 1988 .
[24] Chris N. Potts,et al. Scheduling with batching: A review , 2000, Eur. J. Oper. Res..
[25] Ihsan Sabuncuoglu,et al. Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..
[26] Mark S. Fox,et al. Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .