The problem of scheduling multiproduct and multipurpose batch processes has been studied for more than 30 years using math programming and heuristics. In most formulations, the manufacturing recipes are represented by simplified models using state task network (STN) or resource task network (RTN), transfers of materials are assumed to be instantaneous, constraints due to shared utilities are of...

We propose a general-purpose heuristic approach combining metaheuristics and Mixed Integer Programming to find high quality solutions to the challenging singleand parallel-machine capacitated lotsizing and scheduling problem with sequence-dependent setup times and costs. Commercial solvers fail to solve even medium-sized instances of this NP-hard problem, therefore heuristics are required to fi...

Aggregate production planning (APP) is one of the most important issues carried out in manufacturing environments which seeks efficient planning, scheduling and coordination of all production activities that optimizes the company's objectives. In this paper, we develop a mixed integer linear programming (MILP) model for an integrated aggregate production planning system with closed loop supply ...

The maintenance of the high voltage electricity transmission network in England and Wales (the National Grid) is planned so as to minimise costs taking into account: { location and size of demand for electricity, { generator capacities and availabilities, { electricity carrying capacity of the remainder of the network, i.e. that part not undergoing maintenance. This complex optimization and sch...

Flexible manufacturing systems as technological and automated structures have a high complexity for scheduling. The decision-making process is made difficult with interruptions that may occur in the system these problems increase to define an optimal schedule. research proposes three-stage hybrid algorithm allows rescheduling of operations FMS. novelty presented two approaches: first integratio...

Recently, the scheduling problem in distributed data-intensive computing environments has been an active research topic. This Chapter models the scheduling problem for work-flow applications in distributed dataintensive computing environments (FDSP) and makes an attempt to formulate the problem. Several meta-heuristics inspired from particle swarm optimization algorithm are proposed to formulat...

This research will analyze and discuss the inner behavior of a flexible manufacturing cell in order to buildup its object-oriented simulation system. An object-oriented Petri Net will be built to model a flexible manufacturing cell. The objects of the object-oriented Petri Net are directly mapped from physical objects of a flexible manufacturing cell. This cell includes a robot, several machine...

This paper discussed the scheduling problem of outpatients in a radiology center with an emphasis on priority. To more compatibility to real-world conditions, we assume that the elapsed times in different stages to be uncertain that follow from the specific distribution function. The objective is to minimize outpatients’ total spent time in a radiology center. The problem is formulated as a fle...

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...