共 50 条
- [31] Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobsJOURNAL OF SCHEDULING, 2005, 8 (02) : 161 - 177Crauwels, HAJPotts, CNVan Oudheusden, DVan Wassenhove, LN
- [32] A note on the complexity of family scheduling to minimize the number of late jobsJOURNAL OF SCHEDULING, 2001, 4 (04) : 225 - 229Cheng, TCELiu, ZHShafransky, YM
- [33] Single machine scheduling to minimize the number of early and tardy jobsCOMPUTERS & OPERATIONS RESEARCH, 1996, 23 (08) : 769 - 781Lann, AMosheiov, G
- [34] Single-machine scheduling to minimize the number of early jobs2007 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4, 2007, : 955 - +Huang, R. H.Yang, C. L.
- [35] Scheduling linear deteriorating jobs to minimize the number of tardy jobsJournal of Global Optimization, 2012, 54 : 389 - 404Abbasali JafariGhasem Moslehi
- [36] Scheduling linear deteriorating jobs to minimize the number of tardy jobsJOURNAL OF GLOBAL OPTIMIZATION, 2012, 54 (02) : 389 - 404Jafari, AbbasaliMoslehi, Ghasem
- [37] Single machine scheduling with release and due date assignment to minimize the weighted number of late jobsINFORMATION PROCESSING LETTERS, 1998, 68 (03) : 153 - 159Gordon, VKubiak, W
- [38] Local search heuristics for single-machine scheduling with batching to minimize the number of late jobsEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 90 (02) : 200 - 213Crauwels, HAJPotts, CNVanWassenhove, LN
- [39] Using short-term memory to minimize the weighted number of late jobs on a single machineEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 148 (03) : 591 - 603Péridy, LPinson, ÉRivreau, D