The open shop scheduling problem (OSSP) is one of the standard problems. It consists jobs associated with a finite set tasks developed by different machines. In this case, each machine processes at most operation time, and job processing order on machines does not matter. goal to determine completion times operations processed minimize largest called Cmax. This paper proves that OSSP has path a...

The current wave of digitalization has important implications for manufacturing companies. In this article, we suggest applying the theoretical lens of value co-creation as a comprehensive approach to explore the potential of digitalization trends. We use it to identify the potential of better integrating shop floor workers in the shaping of digital solutions and managerial actions. Insights fr...

In the multiprocessor open shop scheduling problem, jobs are to be processed on a set of processing centers -each having one or more parallel identical machines, while jobs do not have a pre-specified obligatory route. A special case is the proportionate multiprocessor open shop scheduling problem (PMOSP) in which the processing time on a given center is not job-dependent. Applications of the P...

In this work we consider a multiobjective open shop scheduling problem with uncertain processing times and flexible due dates, both modelled using fuzzy sets. We adopt a goal programming model based on lexicographic multiobjective optimisation of both makespan and due-date satisfaction and propose a particle swarm algorithm to solve the resulting problem. We present experimental results which s...

This paper considers the complexity and the correlation of scheduling unit-time jobs on identical parallel machines and unit-time ow-shop scheduling under precedence constraints. It is shown that, in the case of chain-like precedence constraints, the nonpre-emptive parallel-machines problem and the ow-shop problem to minimize maximum or total completion time can be solved in polynomial time, an...

A fast branch and bound algorithm for the job-shop scheduling problem has been developed. Among other hard problems it solves the 10 x 10 benchmark problem which has been open for more than 20 years. We will give a complete description of this algorithm and will present computational results.

In industry 4.0, individuals implement lean and smart manufacturing to improve shop floor management systems. Shop is used control operational performance enhance production within limited constraints. Various approaches are in the present scenario of mainly include value stream mapping, total productive maintenance, Internet Things, artificial intelligence, machine learning, fuzzy logic. The r...