Most of the prior investigations related to production scheduling problems have solely focused on the optimization of an individual criterion under a single constraint; nevertheless, this is most of the time out of true in a real situation. This paper deals with multi machines permutation flow shop scheduling with limited buffers capacity and different release dates of jobs, where the performance is measured by the minimization of the weighted sum of maximum tardiness and makespan. To tackle this NP-hard problem, we present a mixed-integer linear programming model (MILP). Thereafter, using CPLEX software, we generate a set of tests in an endeavor to examine formulation for dissimilar size problems in terms of optimality solution and computational CPU time complexity. Experiment results show that overall the proposed model is computationally avaricious to solve the considering problem.
No takes yet. Share an insight, caveat, or question.
Lebbar et al. (2018) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: