This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...

This paper introduces some advanced genetic algorithms for a complex hybrid flexible flow line problem with a makespan objective that was recently formulated. General precedence constraints among jobs are taken into account, as are machine release dates, time lags and sequence dependent set-up times; both anticipatory and non-anticipatory. This combination of constraints captures many real worl...

In mass customization (MC), the assembly operations of modular products tend to be organized as form flexible mixed-model line (FMMAL). The dynamic scheduling problem FMMAL is quite complex with product sequencing, station allocation, material delivery, disruption events failure, inserting and reworking. To solve these problems, a comprehensive framework combining architecture Internet Manufact...

Dynamic mapping (matching and scheduling) heuristics for a class of independent tasks using heterogeneous distributed computing systems are studied. Two types of mapping heuristics are considered: on-line and batch mode heuristics. Three new heuristics, one for batch and two for on-line, are introduced as part of this research. Simulation studies are performed to compare these heuristics with s...

Dynamic flexible job shop scheduling (JSS) is an important combinatorial optimization problem with complex routing and sequencing decisions under dynamic environments. Genetic programming (GP), as a hyperheuristic approach, has been successfully applied to evolve heuristics for JSS. However, its training process time consuming, it faces the retraining once characteristics of scenarios vary. It ...

this paper explores the flexile flow lines where setup times are sequence- dependent. the optimization criterion is the minimization of total weighted completion time. we propose an iterated greedy algorithm (iga) to tackle the problem. an experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of iga are compared against those of some other exist...

Dynamic rescheduling decision-making problem is an important issue in modern manufacturing system with the feature of combinational computation complexity. This paper introduces a multi-agent based approach using the detailed process, provided by Prometheus methodology, which used for the design of a simultaneous dynamic rescheduling decision making for flexible flow line manufacturing system t...