论文信息 - Open Shop Scheduling Problem with a Non-resumable Flexible Maintenance Period - 字舞流文

Open Shop Scheduling Problem with a Non-resumable Flexible Maintenance Period

Xin Han | Xinbo Liu | Yuan Yuan | Yan Lan

[1] Chris N. Potts,et al. Approximation results for flow shop scheduling problems with machine availability constraints , 2009, Comput. Oper. Res..

[2] Xin Han,et al. A PTAS for non-resumable open shop scheduling with an availability constraint , 2021, Journal of Combinatorial Optimization.

[3] Vitaly A. Strusevich,et al. Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints , 2006 .

[4] Gur Mosheiov,et al. Two-machine flow shop and open shop scheduling problems with a single maintenance window , 2018, Eur. J. Oper. Res..

[5] Vitaly A. Strusevich,et al. Non-preemptive two-machine open shop scheduling with non-availability constraints , 2003, Math. Methods Oper. Res..

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