A Review of Machine Scheduling: Complexity, Algorithms and Approximability

This publication has 433 references indexed in Scilit:

• New Algorithms for an Ancient Scheduling Problem
  Journal of Computer and System Sciences, 1995
• Packet routing and job-shop scheduling inO(congestion+dilation) steps
  Combinatorica, 1994
• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
  OR Spectrum, 1994
• Applying tabu search to the job-shop scheduling problem
  Annals of Operations Research, 1993
• Minimizing the number of tardy jobs in single machine sequencing
  Discrete Mathematics, 1993
• Minimizing Mean Flow Time With Release Time and Deadline Constraints
  Journal of Algorithms, 1993
• A branch-and-bound algorithm to minimize total flow time with unequal release dates
  Naval Research Logistics (NRL), 1992
• An algorithm for single machine sequencing with release dates to minimize maximum cost
  Discrete Applied Mathematics, 1989
• A survey of priority rule-based scheduling
  OR Spectrum, 1989
• A linear time approximation algorithm for multiprocessor scheduling
  BIT Numerical Mathematics, 1979