This paper considers an energy-efficient no-wait permutation flow shop scheduling problem
to minimize makespan and total energy consumption, simultaneously. The processing …

In this paper, we investigate a variant of the unrelated parallel machine scheduling problem
with multiple time windows that is widely employed in the scheduling of earth observation …

Variable neighborhood search is a local search metaheuristic that uses sequentially
different neighborhood structures. This method has been successfully applied to various …

Abstract Variable Neighborhood Descent (VND) is a metaheuristic commonly used as a
local search operator of other metaheuristics. This work analyzes the hypothesis in which …

The objective of this study is to provide a model and method to assist fabricators in making
appropriate precast production plans, coordinating factories prefabrication and on-site …

With the development of the customization concept, small-batch and multi-variety production
will become one of the major production modes, especially for fast-moving consumer goods …

The obnoxious p‐median problem consists of selecting p locations, considered facilities, in a
way that the sum of the distances from each nonfacility location, called customers, to its …

This paper considers a two-stage assembly flowshop scheduling problem with distinct due
windows to minimise the sum of weighted earliness and tardiness. There are several …

This paper considers a scheduling problem of processing jobs on two uniform parallel
machines. The objective is to minimize total tardiness, subject to the constraint that the total …

As the prefabrication construction method plays an increasingly important role in the
construction of cross‐sea bridges, coordinating the schedule between off‐site prefabrication …