Lot splitting is a new approach for improving productivity by dividing production lots into sublots. This approach enables accelerating production flow, reducing lead-time and increasing the utilization of organization resources. Most of the lot splitting models in the literature have addressed a single objective problem, usually the makespan or flowtime objectives. Simultaneous minimization of...

In this work, a review and comprehensive evaluation of heuristics and metaheuristics for the m-machine flowshop scheduling problem with the objective of minimising total tardiness is presented. Published reviews about this objective usually deal with a single machine or parallel machines and no recent methods are compared. Moreover, the existing reviews do not use the same benchmark of instance...

This paper formulates a mathematical model for the Green Vehicle Routing Problem (GVRP), incorporating bi-fuel (natural gas and gasoline) pickup trucks in a mixed vehicle fleet. The objective is to minimize overall costs relating to service (earliness and tardiness), transportation (fixed, variable and fuel), and carbon emissions. To reflect a real-world situation, the study considers: (1) a co...

In this paper a mixed integer lineal programming (MILP) approach is proposed for the scheduling of multiple dissimilar orders in a non-continuous serial production environment. In this context, different products must be produced in several stages, in which a single machine is chosen per stage to accomplish the production of each order. This work has been carried out in a manufacturing company ...

There has been extensive academic research on the optimisation of reverse logistics (RL) and closed-loop supply chain (CLSC) network design. However, existing literature is lacking in several features practical relevance, simultaneous consideration dynamic characteristics, including multi-period setting, inventory factors, environmental footprints, scalability application. This shortcoming prim...

As multi-factory production models are more widespread in modern manufacturing systems, a distributed blocking flowshop scheduling problem (DBFSP) is studied which no buffer between adjacent machines and setup time constraints considered. To address the above problem, mixed integer linear programming (MILP) model first constructed, its correctness verified. Then, an iterated greedy-algorithm-bl...

The Dependency Diagram of a Linear Programme (LP) shows how the successive inequalities of an LP depend on former inequalities, when variables are projected out by FourierMotzkin Elimination. This is explained in a paper referenced below. The paper, given here, extends the results to the Mixed Integer case (MILP). It is shown how projection of a MILP leads to a …nite disjunction of polytopes. T...

Jeroslow and Lowe gave an exact geometric characterization of subsets of R that are projections of mixed-integer linear sets, a.k.a MILP-representable sets. We give an alternate algebraic characterization by showing that a set is MILP-representable if and only if the set can be described as the intersection of finitely many affine Chvátal inequalities. These inequalities are a modification of a...