Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines

Abstract

We consider the total weighted completion time minimization for the two-parallel capacitated machines scheduling problem. In this problem, one of the machines can process jobs until a certain time T1 after which it is no longer available. The other machine is continuously available for performing jobs at any time. We prove the existence of a strongly Fully Polynomial Time Approximation Scheme (FPTAS) for the studied problem, which extends the results for the unweighted version (see [I. Kacem, Y. Lanuel and M. Sahnoune, Strongly Fully Polynomial Time Approximation Scheme for the two-parallel capacitated machines scheduling problem, Int. J. Plann. Sched. 1 (2011) 32–41]). Our FPTAS is based on the simplification of a dynamic programming algorithm. Moreover, we present a set of numerical experiments and we discuss the results.

Robust facility location decisions for resilient sustainable supply chain performance in the face of disruptions

“…Recently, Benyoucef et al (2013) simultaneously considered a facility location and supplier selection problem with random demand and under reliable and unreliable suppliers and solved the model by using a Lagrangian relaxation approach. Likewise, Lu et al (2017) and Kacem et al (2018) presented a robust stochastic supply chain network model in the context of a case study to highlight the risk preference association and capacitated machine allocation problems. However, Gammelgaard (2019) argued that the emerging technological nature of changing the competitive advantage that a supply chain can attain by shaping its logistics strategies can be highly significant.…”

“…Likewise, Kacem et al (2018) presented a robust stochastic supply chain network model in the context of a case study to highlight the risk preference association and capacitated machine allocation problems. However, Gammelgaard (2019) argued that the emerging technological nature of changing the competitive advantage that a supply chain can attain by shaping its logistics strategies can be highly significant.…”

Two-machine flow shop with synchronized periodic maintenance

“…In the last decade, scheduling problems considering machine availability (in single machine, parallel machines [29,46,47], flow shop [1,13], job shop [3], open shop [33], flexible flow shop [40] problems) have attracted researchers' attention due to its realistic characteristic. The most studied case is the single machine scheduling problem.…”