Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs

This publication has 11 references indexed in Scilit:

• Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems
  Naval Research Logistics (NRL), 1993
• Completion time variance minimization on a single machine is difficult
  Operations Research Letters, 1993
• Scheduling with monotonous earliness and tardiness penalties
  European Journal of Operational Research, 1993
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
  Operations Research, 1991
• Sequencing with Earliness and Tardiness Penalties: A Review
  Operations Research, 1990
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
  Naval Research Logistics (NRL), 1987
• Minimizing mean absolute deviation of completion times about a common due date
  Naval Research Logistics Quarterly, 1986
• Minimizing the average deviation of job completion times about a common due date
  Naval Research Logistics Quarterly, 1981
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
  Mathematics of Operations Research, 1978
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
  Management Science, 1977