Author:
Emmons Hamilton,Vairaktarakis George
Reference16 articles.
1. Chen, B. (1995) Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage, Journal of the Operational Research Society, 46, 234–244.
2. Daniels, R.L. and J.B. Mazzola (1993) A Tabu-Search Heuristic for the Flexible-Resource Flow Shop Scheduling Problem, Annals of Operations Research, 41, 207–230.
3. Daniels, R.L. and J.B. Mazzola (1994) Flow Shop Scheduling with Resource Flexibility, Operations Research, 42, 504–522.
4. Garey, M.R. and D.S. Johnson (1979) Computers and Intractability: a Guide to the Theory of NP-Completeness, W.H. Freeman and Co, San Francisco.
5. Hoogeveen, J.A., J.K. Lenstra and B. Veltman (1996) Preemptive Scheduling in a Two-Stage Multiprocessor Flow Shop is NP-Hard, European Journal of Operational Research, 89, 172–175.