Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage

Journal of Scheduling

Volumn 5, Issue 3, 2002, Pages 205-225

  Sevastianov, S V ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

Approximation; Multiprocessor flowshop scheduling; Uniform parallel machines; Worst case analysis

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GEOMETRY; HEURISTIC METHODS; MACHINERY; POLYNOMIALS;

MULTIPROCESSOR FLOWSHOP SCHEDULING; UNIFORM PARALLEL MACHINES; WORST-CASE ANALYSIS;

SCHEDULING;

EID: 0346388714     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.98     Document Type: Article

References (14)

1. Schuurman P, Woeginger GJ. A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Report Woe-01, March 1997, Combinatorial Approximation Algorithms, TU Graz, Austria, 1997.
2. Johnson SM. Optimal two and three-stage production schedules with set-up times included. Naval Research Logistics Quarterly 1954; 1:61-68.
3. Garey MR, Johnson DS, Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1976; 1:117-129.
4. Hoogeveen JA, Lenstra JK, Veltman B. Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. European Journal of Operations Research 1996; 89:172-175.
5. Hall LA. Approximability of flow shop scheduling. In Proceedings of 36th IEEE Symposium on Foundations of Computer Science, 1995; 82-91.
6. Hochbaum DS, Shmoys DB. Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the Association for Computing Machinery 1987; 34:144-162.
7. Kyparisis GJ, Koulamas C. Flexible flowshop scheduling with uniform parallel machines. Mathematics of Operations Research, submitted.
8. Sevastianov SV. On a compact vector summation. Diskretnaya Matematika 1991; 3(3):66-72 (in Russian).
9. Sevastianov SV. Nonstrict vector summation in the plane and its application to scheduling problems. In Operations Research and Discrete Analysis, Korshunov AD (ed.), Kluwer: Dordrecht, 1997; 241-272.
10. Chen B. Scheduling multiprocessor flow shops. In New Advances in Optimization and Approximation, Du D-Z, Sun J (eds), Kluwer: Dordrecht, 1994; 1-8.
11. Lee C-Y, Vairaktarakis GL. Minimizing makespan in hybrid flowshops. Operations Research Letters 1994; 16:149-158.
12. Sevastianov SV. Vector summation in Banach space and polynomial algorithms for flow shops and open shops. Mathematics of Operations Research 1995; 20:90-103.
13. Sevastianov SV. Construction of an approximate schedule for a flow-type system. Upravlyaemye Sistemy 1993; 31:66-71 (in Russian).
14. Kyparisis GJ, Koulamas C. Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flowshops. Naval Research Logistics 2000; 47(3):259-268.