其他1. | Bansal, S.P.(1980)。Single machine scheduling to minimize weighted sum of completion times with secondary criterion - a branch and bound approach。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
2. | Biskup, D. and M. Feldmann(2001)。Benchmarks for scheduling on a single-machine against restrictive and unrestrictive common due dates。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
3. | Burns, R.N.(1976)。Scheduling to minimize the weighted sum of completion times with secondary criteria。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
4. | Chand, S. and H. Schneeberger(1988)。Single machine scheduling to minimize weighted earliness subject to no tardy jobs。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
5. | Chen, W.-Y. and G.-J. Sheen(2007)。Single machine scheduling with multiple performance measures: minimizing job dependent earliness and tardiness subject to the number of tardy jobs。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
6. | Cheng, T.C.E., Z.L. Chen and N.V. Shakhlevich(2002)。Common due date assignment and scheduling with ready times。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
7. | Cheng, T.C.E. and H.G. Kahlbacher(1991)。A proof for the longest/job/first policy in one/machine scheduling。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
8. | Emmons, H.(1975)。A note on a scheduling problem with dual criteria。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
9. | Feldmann, M. and D. Biskup(2003)。Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
10. | Framinan, J.M. and R. Leisten(2006)。A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
11. | Hall, N., W. Kubiak and S. Sethi(1991)。Earlinesstardiness scheduling problems, II: deviation of completion times about a restrictive common due date。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
12. | Heck, H. and S. Roberts(1972)。A note on the extension of a result on scheduling with secondary criteria。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
13. | Hino, C.M., D.P. Ronconi and A.B. Mendes(2005)。Minimizing earliness and tardiness penalties in a single-machine problem with a common due date。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
14. | Lawler, E.L.(1983)。Scheduling a single machine to minimize the number of late jobs。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
15. | Mazzini, R. and V.A. Armentano(2001)。A heuristic for single machine scheduling with early and tardy costs。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
16. | Miyazaki, S.(1981)。One machine scheduling problem with dual criteria。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
17. | Moore, J.M.(1986)。An n job, one machine sequencing algorithm for minimizing the number of late jobs。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
18. | Nagar, A., J. Haddock and S. Heragu(1995)。Multiple and bicriteria scheduling: a literature survey。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
19. | Nelson, R.T., R.K. Sarin and R.L. Daniels(1986)。Scheduling with multiple performance measures: the one-machine case。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
20. | Pathumnakul, S. and P.J. Egbelu(2006)。An algorithm for minimizing weighted earliness penalty in assembly job shops。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
21. | Sen, T. and S.K. Gupta(1983)。A branch-and bound procedure to solve a bicriterion scheduling problem。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
22. | T’kindt, V. and J.-C. Billaut(1999)。Some guideline to solve multicriteria scheduling problems。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
23. | Valente, J.M.S. and R.A.F.S. Alves(2005)。An exact approach to early/tardy scheduling with release dates。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
24. | Valente, J.M.S. and R.A.F.S. Alves(2006)。Heuristics for the early/tardy scheduling problem with release dates。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |
25. | Yeung, W.K., C. Oguz and T.C.E. Cheng(2004)。Twostage flowshop earliness and tardiness machine scheduling involving a common due window。 ![](/gs32/thssjcncl/image/nclsfx.gif) ![new window](/gs32/images/newin.png) |