[1]HALL N G, POSNER M E. Earliness-tardiness scheduling prob-lems, I: weighted deviation of completion times about a common due date [J]. Operations Research, 1991, 39(5): 836-846.
[2]SUNG C S, MIN J I. Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date [J]. European Journal of Operational Research, 2001, 131(1): 95-106.
[3]LI S, ZHU Y. Earliness/tardiness scheduling problem in flow shop [J]. Computer Integrated Manufacturing Systems, 2006, 12(8): 1235-1240.(李素粉,朱云龙.流水车间作业提前/拖期调度问题研究[J].计算机集成制造系统,2006,12(8):1235-1240.)
[4]TAVAKKOLI-MOGHADDAM R, RAHIMI-VAHED A, MIRZAEI A H. A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness [J]. Information Sciences, 2007, 177(22): 5072-5090.
[5]CHANDRA P, MEHTA P, TIRUPATI D. Permutation flow shop scheduling with earliness and tardiness penalties [J]. International Journal of Production Research, 2009, 47(20): 5591-5610.
[6]MOSLEHI G, MIRZAEE M, VASEI M, et al. Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness [J]. International Journal of Production Economics, 2009, 122(2): 763-773.
[7]RONCONI D, BIRGIN E G. Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness [M]// Just-in-Time systems. New York: Springer, 2012: 91-105.
[8]SCHALLER J, VALENTE J M S. An evaluation of heuristics for scheduling a non-delay permutation flow shop with family setups to minimize total earliness and tardiness [J]. Journal of the Operational Research Society, 2012, 64(6): 805-816.
[9]LI J, TANG L, WU H. Hot rolling steel tube batch scheduling with earliness/tardiness penalties [J]. Control and Decision, 2005, 20(6): 665-668.(李建祥,唐立新,吴会江.具有提前/拖期惩罚的热轧钢管批调度问题研究[J].控制与决策,2005,20(6):665-668.)
[10]GEEM Z W, KIM J H, LOGANATHAN G V. A new heuristic optimization algorithm: harmony search [J]. Simulation, 2001, 76(2): 60-68.
[11]MAHDAVI M, FESANGHARY M, DAMANGIR E. An improved harmony search algorithm for solving optimization problems [J]. Applied Mathematics and Computation, 2007, 188(2): 1567-1579.
[12]NAWAZ M, ENSCORE E E, Jr, HAM I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem [J]. Omega, 1983, 11(1): 91-95.
[13]DONG X, HUANG H, CHEN P. An improved NEH-based heuristic for the permutation flowshop problem [J]. Computers and Operations Research, 2008, 35(12): 3962-3968.
[14]RAO R V, SAVSANI V J, VAKHARIA D P. Teaching-learning-based optimization: a novel method for constrained mechanical design optimization problems [J]. Computer-Aided Design, 2011, 43(3): 303-315.
[15]RAO R V, SAVSANI V J, VAKHARIA D P. Teaching-learning-based optimization: an optimization method for continuous non-linear large scale problems [J]. Information Sciences, 2012, 183(1): 1-15. |