Using mixed graph coloring to minimize total completion time in job shop scheduling

This publication has 12 references indexed in Scilit:

• Scheduling Problems and Mixed Graph Colorings
  Optimization, 2002
• Is a unit-time job shop not easier than identical parallel machines?
  Discrete Applied Mathematics, 1998
• Mixed graph colorings
  Mathematical Methods of Operations Research, 1997
• Total completion time minimization in two-machine job shops with unit-time operations
  European Journal of Operational Research, 1996
• NP-hardness of shop-scheduling problems with three jobs
  Discrete Applied Mathematics, 1995
• The complexity of shop-scheduling problems with two or three jobs
  European Journal of Operational Research, 1991
• An efficient algorithm for the job-shop problem with two jobs
  Computing, 1988
• An introduction to timetabling
  European Journal of Operational Research, 1985
• Unit Execution Time Shop Problems
  Mathematics of Operations Research, 1982
• A Geometric Model and a Graphical Algorithm for a Sequencing Problem
  Operations Research, 1963