Some recent trends in manufacturing in particular and business in general, lead to new approaches regarding the organisation and software architecture, mainly adopting distributed solutions. Such organisations imply organisational and technological evolution through agility, distribution, decentralisation, reactivity and flexibility. New organisational and technological paradigms are needed in ...

It is vital for manufacturing companies not only to cope with frequent product changes and fluctuating demands, but also to reduce the impact of disturbances on the overall manufacturing performance. In this paper a real-time scheduling mechanism for dynamic discrete manufacturing is presented. Modified mean flow time performance for different scheduling approaches is compared through off-line ...

In this paper we consider n-jobs, m-machines permutation flow shop scheduling problems. Flow shop scheduling is one of the most important combinational optimization problems. The permutation flow shop scheduling problems are NP-Hard (Non deterministic Polynomial time Hard). Hence many heuristics and metaheuristics were addressed in the literature to solve these problems. In this paper a hybrid ...

As a part of the Analytics and Insights team at Tata Consultancy Services (TCS), Anuj specializes in supply chain management, operation management, and optimization. He has worked on various supply chain and manufacturing domain projects. He has a PhD in industrial engineering from Indian Institute of Technology (IIT) Delhi. Anuj has worked on applying various meta-heuristics and fuzzy systems ...

Many modern logic programming languages provide more flexible scheduling than the Prolog traditional left-to-right computation rule. Computation generally also proceeds following some ñxed scheduling rule but certain goals are dynamically "delayed" until their arguments are sufficiently instantiated to allow the cali to run efliciently. This general form of scheduling is referred to as dynamic ...

In this paper, scheduling problems in Flexible Manufacturing Cells (FMC) are studied. The scheduling objective is to minimize the makespan. We used a genetic algorithm (GA) for solving the optimization scheduling problem. We have developed one FMC with industrial characteristics with the objective of studying scheduling problems in these types of manufacturing systems (single machine scheduling...

This paper presents several local search meta-heuristics for the problem of scheduling a single machine to minimise total weighted tardiness. A genetic algorithm for the static single machine total weighted tardiness problem is presented, and a multi-start version named metaGA is proposed. The obtained computational results permit to conclude about their efficiency and effectiveness. The resolu...

The recent manufacturing environment is characterized as having diverse products due to mass customization, short production lead-time, and unstable customer demand. Today, the need for flexibility, quick responsiveness, and robustness to system uncertainties in production scheduling decisions has increased significantly. In traditional job shops, tooling is usually assumed as a fixed resource....