A GRASP™ for a difficult single machine scheduling problem

This publication has 9 references indexed in Scilit:

• Flight Scheduling and Maintenance Base Planning
  Management Science, 1989
• A probabilistic heuristic for a computationally difficult set covering problem
  Operations Research Letters, 1989
• Note—Operations Sequencing in Discrete Parts Manufacturing
  Management Science, 1989
• Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
  Management Science, 1988
• A BI-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
  Computers & Operations Research, 1987
• Semi-greedy heuristics: An empirical study
  Operations Research Letters, 1987
• Scheduling Tasks with Due Dates in a Fabrication/Assembly Process
  Operations Research, 1987
• Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines
  Operations Research, 1987
• Various optimizers for single‐stage production
  Naval Research Logistics Quarterly, 1956