共 63 条
[1]
Campbell HG(1970)A heuristic algorithm for the n-job m-machine sequencing problem Manage Sci 16 B630-B637
[2]
Dudek RA(1978)Ordonnancements à contraintes disjonctives RAIRO Rech Oper. Oper Res 12 333-351
[3]
Smith ML(1999)A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization Prod Plann Contr 10 707-714
[4]
Carlier J(2007)The tricriteria flowshop scheduling problem Int J Adv Manuf Technol 36 1210-1220
[5]
Chakravarthy K(2006)Flowshop scheduling research after five decades Eur J Oper Res 169 699-711
[6]
Rajendran C(1993)Heuristic algorithms for scheduling in no-wait flow shop Int J Prod Econ 32 285-290
[7]
Eren T(2005)Flowshop- scheduling problems with makespan criterion: a review Int J Prod Res 43 2895-2929
[8]
Güner E(1960)Some numerical experiments for an MxJ flow shop and its decision- theoretical aspects Oper Res 8 178-184
[9]
Gupta JND(2008)A combinational particle swarm optimisation for solving permutation flowshop problems Comput Ind Eng 54 526-538
[10]
Stafford JEF(1995)Particle swarm optimization Proc IEEE Int Conf Neural Netw 1995 1942-1948