Traditional research on machine scheduling focuses on job allocation and sequencing to
optimize certain objective functions that are defined in terms of job completion times. With …

This paper proposes a novel multi-objective model for an unrelated parallel machine
scheduling problem considering inherent uncertainty in processing times and due dates …

Grouping problems are a special type of combinatorial optimization problems that have
gained great relevance because of their numerous real-world applications. The solution …

This paper proposes a hybrid particle swarm optimization algorithm in a rolling horizon
framework to solve the aircraft landing problem (ALP). ALP is an important optimization …

This research aims at scheduling a set of Batch Processing Machines (BPMs) used to test
printed circuit boards in an electronics manufacturing facility. The facility assembles and …

Using unrelated parallel machine scheduling to minimize the total earliness and tardiness of
jobs with distinct due dates is a nondeterministic polynomial-hard problem. Delayed …

In our previous research applied to the job shop scheduling problem (JSSP) for machine
tool production, the multi-objective optimisation model based on the particle swarm …

In recent years, decision makers give more importance to the maintenance function, viewing
its substantial contribution to business productivity. However, most literature on scheduling …

In recent years research on parallel machine scheduling has received an increased
attention. This paper considers minimisation of total tardiness for scheduling of n jobs on a …

Purpose Cycle time reduction is important for order fulling process but often subject to
resource constraints. This study considers an unrelated parallel machine environment …