Makespan minimization in preemptive two machine job shops

This publication has 7 references indexed in Scilit:

• Approximability of flow shop scheduling
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Improved Approximation Algorithms for Shop Scheduling Problems
  SIAM Journal on Computing, 1994
• An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
  Mathematics of Operations Research, 1982
• Flowshop and Jobshop Schedules: Complexity and Approximation
  Operations Research, 1978
• Bounds on Multiprocessing Timing Anomalies
  SIAM Journal on Applied Mathematics, 1969
• An extension of Johnson's results on job IDT scheduling
  Naval Research Logistics Quarterly, 1956
• Letter to the Editor—A Graphical Approach to Production Scheduling Problems
  Operations Research, 1956