The economic lot scheduling problem: a survey

Santander-Mercado, Alcides; Jubiz-Diaz, María

doi:10.1080/00207543.2016.1154214

Cited by 18 publications

(2 citation statements)

References 83 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The ELSP is an important problem in scheduling which has been enormously considered by researchers during the last decades and due to its complexity, it is known as NP-hard problem demonstrated by Hsu in 1983 [2]. Santander-Mercado and Maria Jubiz-Diaz [3] surveyed ELSP and classified this problem in different aspects. They divided the problem into single facility and multi facility, based on the production system and regarding the scheduling approach, three different approaches were introduced: Common cycle approach, Basic/extended basic approach and Time-varying lot size approach.…”

Section: Methodsmentioning

confidence: 99%

Applied real-valued genetic algorithm for an extended model of economic lot, purchase and delivery scheduling problem

Hasheminejad

Valipour

Khoshnood

2022

IRASE

View full text Add to dashboard Cite

Supply chain management intends to integrate supply chains' activities such as material flow, information flow and financial issues. Material flow management is the most significant issue since the inventory level in the whole supply chain could be optimized by an integrated plan. In other words, when one member of the supply chain plans to reduce its inventory level solely, despite reducing inventory in this node the inventory will be stocked in other partners' warehouses. Therefore, in this paper a new mathematical model has been developed to facilitate the process of finding the optimum solution in economic production, purchase and delivery lots and their schedules in a three-echelon supply chain environment; including raw material in suppliers, manufacturer and assembly facility as a customer. The manufacturer with a flow shop system provides its requirements from supplier, assemble multiple products, and delivers products to the customer (automotive OEM alike) on an optimum multiple delivery points. The delivery cycles would be identified through the production common cycle regarding the supply chain flexibility. Finally, a modified real-valued Genetic Algorithm (MRGA), and an Optimal Enumeration Method (OEM) are developed, and some numerical experiments have been done and compared as well.

show abstract

Section: Methodsmentioning

confidence: 99%

Applied real-valued genetic algorithm for an extended model of economic lot, purchase and delivery scheduling problem

Hasheminejad

Valipour

Khoshnood

2022

IRASE

View full text Add to dashboard Cite

show abstract

“…The goals such as earliness, tardiness, makespan, setup time, etc. (see Allahverdi et al, 2008;Santander-Mercado and Jubiz-Diaz, 2016;Nair et al, 2016) may be of interest for managers of manufacturing organizations. Such scheduling problems under the given goals are mathematically modelled as a linear programming model (LP), or a mixed integer linear programming model (MILP), or even as a mixed integer nonlinear programming model (MINLP).…”

Section: Introductionmentioning

confidence: 99%

Tabu Search Based Hybrid Meta-Heuristic Approaches for Schedule-Based Production Cost Minimization Problem for the Case of Cable Manufacturing Systems

Daneshdoost¹,

Hajiaghaei–Keshteli²,

Şahin³

et al. 2022

Informatica

View full text Add to dashboard Cite

This paper models and solves the scheduling problem of cable manufacturing industries that minimizes the total production cost, including processing, setup, and storing costs. Two hybrid meta-heuristics, which combine simulated annealing and variable neighbourhood search algorithms with tabu search algorithm, are proposed. Applying some case-based theorems and rules, a special initial solution with optimal setup cost is obtained for the algorithms. The computational experiments, including parameter tuning and final experiments over the benchmarks obtained from a real cable manufacturing factory, show superiority of the combination of tabu search and simulated annealing comparing to the other proposed hybrid and classical meta-heuristics.

show abstract