The planning of Manufacturing Systems involves frequently the resolution of a huge amount and variety of combinatorial optimization problems with a important impact on the performance of manufacturing organizations. The proposed approach is in line with reality and away from the approaches that deal with static and classic or basic Job-Shop scheduling problems. In fact, in real world, where pro...

Nowadays, flexible manufacturing system (FMS) is introduced as a response to the competitive environment. Scheduling of FMS is more complex and more difficult than the other scheduling production systems. One of the main factors in scheduling of FMS is variable time of taking orders from customers, which leads to a sudden change in the manufacturing process. Also, some problems are created in p...

This paper presents a decision support system for improving the management of intermodal container terminals. It is implemented as a modular architecture which integrates a forecasting model, a planner and a simulation module. While the forecasting module estimates container traffic, the planning module uses this information to generate efficient policies for storage, resource allocation and sc...

This paper presents a bi-objective MIP model for the flexible flow shop scheduling  problem (FFSP) in which the total weighted tardiness and the energy consumption are minimized simultaneously. In addition to considering unrelated machines at each stage, the set-up times are supposed to be sequence- and machine-dependent, and it is assumed that jobs have different release tim...

In this chapter, we review a few important concepts from Grid computing related to scheduling problems and their resolution using heuristic and meta-heuristic approaches. Scheduling problems are at the heart of any Grid-like computational system. Different types of scheduling based on different criteria, such as static vs. dynamic environment, multi-objectivity, adaptivity, etc., are identified...

appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. one type of scheduling problems is just-in-time (jit) scheduling and in this area, motivated by jit manufacturing, this study investigates a mathematical model for...

Scheduling decisions in time-critical systems are very difficult, due to the vast number of systems’ parameters and tasks’ attributes involved in such decisions. Due to the intractability of the problem, time-critical systems often have to resort to heuristic techniques. Value-based scheduling heuristics have been found in the literature to experience a more graceful degradation under overload ...

1 Queen Mary, University of London, Mile End Road, London, United Kingdom 2 BT Security Research Centre, Adastral Park, Ipswich, United Kingdom Abstract: A new distributed computing architecture, Dynamic Virtual Private Network (DVPN), is introduced. The DVM (Dynamic VPN Manager) works as the Autonomous System (AS) administrator in the DVPN system to perform resource scheduling and liaise with ...

Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...