English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this research, the economic lot scheduling problem (ELSP), as an NP-hard problem in terms of a bi-objective approach considering deteriorating items and shortage, is studied. The goal is to simultaneously minimise ‘setup and inventory holding costs, comprising deterioration’, and ‘total amount of units facing shortage throughout every period. Two policies besides a heuristic method are employed simultaneously, named extended basic period and Power-of-Two (PoT), to make sure of having feasible replenishment cycles. For handling the considered problem, three multi-objective techniques are employed: non-dominated sorting genetic algorithm II (NSGAII), non-dominated ranking genetic algorithm (NRGA), and a multi-objective procedure hybridized of NSGAII and particle swarm optimization (PSO), called PSNSGAII. Also, three metrics are used to assess the quality of the algorithms’ outputs, including spacing, mean ideal distance, and spread. Experimental results, including extensive conducted parametric and non-parametric statistical analyses, prove that the proposed hybrid PSNSGAII algorithm can well meet discussed criteria compared to other employed algorithms in both ‘quality of solutions’ and ‘diversity’ in almost all small, medium and large test instances. Finally, some useful managerial and practical insights are presented.

Hybrid bi-objective economic lot scheduling problem with feasible production plan equipped with an efficient adjunct search technique