art_10.1007
00 - Baptiste-Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times.pdf
02 - Global Constraints for Partial CSPs_ A Case-Study of_Resource and Due Date Constraints.pdf
07 - Minimizing late jobs in the general one machine_scheduling problem.pdf
08 - Various Mathematical Programming Formulations for a_General One Machine Sequencing Problem.pdf
09 - A Branch and Bound Method to Minimize the Number of Late Jobs on a Single Machine.pdf
12 - A Dynamic Programming Algorithm for Preemptive_Scheduling of a Single Machine to Minimize the Number of Late Jobs.pdf
20 - Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs - Diepen, van den Akken, Hoogeveen (Utrecht University Technical Report. UU-CS-054 2005).pdf
21 - A branch and bound to minimize the number of late jobs on a single machine with release time constraints - Baptiste, Peridy, Pinson (European Journal of Operational Research, Volume 144, Number 1, 1 January 2003, pp. 1-11(11)).pdf
22 - A Branch and Bound Method to Minimize the Number of Late Jobs on a Single Machine - Dauzère-Pérès, Sevaux (1998).pdf
23 - Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates - Nessah, Kacem (2011).pdf
24 - Optimal Two and Three-Stage Production Schedules With Set-Up Time Included - S. M. Johnson (1953).pdf
25 - Single-machine scheduling of unit-time jobs with earliness and tardiness penalties.pdf
79_03_scheduling_survey.pdf
A time indexed formulation of_non-preemptive single machine_scheduling problems.pdf
Chrobak,etal-A note on scheduling equal-length jobs to maximize throughput (full).pdf
Handbook of Production Scheduling 0387331158.pdf
Knapsack-Like Scheduling Problems, the Moore-
Principles_of_Sequencing_and_Scheduling.pdf
Time-Indexed Formulations for_Machine Scheduling Problems__Column Generation.pdf