Abstract The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of
the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the …

Among the different tasks in production logistics, job scheduling is one of the most important
at the operational decision-making level to enable organizations to achieve competiveness …

This paper presents a novel Mixed-Integer Nonlinear Programming (MINLP) model for a
parallel-line Capacitated Lot-Sizing Problem (CLSP) with the sequence-dependent setup …

Production rescheduling is one of the most challenging problems in production
management, in which some parameters, such as customer demand and job processing …

In this paper, we propose a simple but efficient heuristic that combines construction and
improvement heuristic ideas to solve multi-level lot-sizing problems. A relax-and-fix heuristic …

A lot-sizing and scheduling problem with sequence-dependent setups is addressed in this
paper. In the production system, manufactories receive raw materials from upstream sites …

This research addresses the integrated lot-sizing and scheduling problem with complex
setup structure in which the required raw materials are hazardous and the inherent risk of …

This paper proposes a new soft computing model (artificial intelligence model) for modeling
rock fragmentation (ie, the size distribution of rock (SDR)) with high accuracy, based on a …

Nowadays, achieving higher levels of flexibility in manufacturing systems is necessary to
maintain and enhance competitiveness. Accordingly, a new generation of production …

This paper presents an empirical assessment of the General Lot-Sizing and Scheduling
Problem (GLSP) under demand uncertainty by means of a budget-uncertainty set robust …