论文信息 - Approximation algorithms for parallel open shop scheduling

Approximation algorithms for parallel open shop scheduling

This paper investigates the parallel open shop scheduling problem. In this problem each job consists of two independent operations, which must be non-preemptively processed by one of m parallel identical two-machine open shops. The objective is to minimize the makespan. Because of NP-hardness, we provide polynomial time approximation algorithms for the problem. If there are m open shops, our algorithm has a worst case ratio of 2. If only two open shops are valid, it can be improved to 32.

[1] Mingyuan Chen,et al. Parallel flowshop scheduling using Tabu search , 2003 .

[2] Gerhard J. Woeginger,et al. Approximation algorithms for the multiprocessor open shop scheduling problem , 1999, Oper. Res. Lett..

[3] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .

[4] Steef L. van de Velde,et al. Approximation algorithms for the parallel flow shop problem , 2012, Eur. J. Oper. Res..

[5] Teofilo F. Gonzalez,et al. Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[6] Wieslaw Winiecki. Methodology for distributed designing of distributed virtual instruments , 2003, Second IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, 2003. Proceedings.

[7] Klaus Jansen,et al. Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem , 2000, STACS.

[8] Vitaly A. Strusevich,et al. Worst-case analysis of heuristics for open shops with parallel machines , 1993 .

[9] George L. Vairaktarakis,et al. The use of flowlines to simplify routing complexity in two-stage flowshops , 2000 .

[10] Gerhard J. Woeginger,et al. A Review of Machine Scheduling: Complexity, Algorithms and Approximability , 1998 .