In this paper, we revisit the economic lot scheduling problem (ELSP), where a family of products is produced on a single machine, or facility, on a continual basis. Our focus is on the determination of a feasible production schedule, including the manufacturing batch size of each item. We assume that total backordering is permissible and that each of the products has a limited post-production s...

O que acontece quando um Estado autoritário censura a pesquisa sociológica? Este artigo aborda aspectos das relações entre pesquisas científicas sobre o negro e configuração repressiva assumida pelo aparato estatal quanto seu debate acadêmico na Ditadura Militar brasileira. São objeto de análise três trabalhos em Ciências Sociais Paulo, saber os mestrados Edson Antonio Eustáquio (ELSP) Eduardo ...

Economic lot scheduling problem has been an important topic in production planning and scheduling research for more than four decades. The problem is known to be NP-hard due to its combinatorial nature. In this paper, a meta-heuristics algorithm based on Simulated Annealing (SA) is proposed. Besides on explaining how to use SA, the effects of changing in production frequency on sequence and als...

In this paper we discuss stochastic Economic Lot Scheduling Problems (ELSP), i.e., settings where several items need to be produced in a common facility with limited capacity, under significant uncertainty regarding demands, production times, setup times, or combinations thereof. We propose a class of production/ inventory strategies for stochastic ELSPs and describe how a strategy which minimi...

In this research we study the multi-product economic lot scheduling problem (ELSP) with manufacturing and remanufacturing opportunities. Manufacturing and remanufacturing operations are performed on the same production line. Both manufactured and remanufactured products have the same quality thus fulfil the same demand stream. Tang and Teunter (2006) firstly studied this type of economic lot sc...

This article addresses the economic lot sizing and scheduling problem in flexible flow lines with unrelated parallel machines over a finite planning horizon. The objective is determination of a cyclic schedule that minimizes the sum of setup and inventory holding costs per unit time without any stock-out. A new mixed zero–one nonlinear mathematical programming has been developed for the problem...

<p style='text-indent:20px;'>We address the problem of finding <inline-formula><tex-math id="M1">\begin{document}$ K $\end{document}</tex-math></inline-formula> best Zero-Inventory-Ordering (ZIO) policies an Economic Lot-Sizing Problem (ELSP) with id="M2">\begin{document}$ n time periods. To this end, we initially focus on devising efficient algorithm to determi...