The proposed hybrid stage shop scheduling (HSSS) model, inspired from a real case in the high-fashion industry, aims to fully exploit the potential of parallel resources, splitting and overlapping concurrent operations among teams of multifunctional machines and operators on the same job. The HSSS formally extends mixed shop scheduling (a combination of flowshop and open shop), which is able to...

This article introduces a self-stabilizing deadlock-detection algorithm for the OR model. The algorithm is complete, because it detects all deadlocks, and it is correct, because it does not detect false deadlocks. Because of the self-stabilization property, the algorithm supports dynamic changes in the wait-for graph on which it works, and transient faults; also, it can be started in an arbitra...

background recognizing the significant impact of wait times for care for individuals with complex chronic conditions, we applied a lean methodology, namely – an adaptation of value stream mapping (vsm) to meet the needs of people with multiple chronic conditions and to improve wait times without additional resources or funding.   methods over an 18-month time period, staff applied a patient-cen...

Scalasca is a performance toolset that has been specifically designed to analyze parallel application execution behavior on large-scale systems with many thousands of processors. It offers an incremental performance-analysis procedure that integrates runtime summaries with in-depth studies of concurrent behavior via event tracing, adopting a strategy of successively refined measurement configur...

We consider the problem of minimizing the makespan in a flowshop involving maximal and minimal time lags, denoted by Fm|θ, θ|Cmax. Time lag constraints generalize the classical precedence constraints between operations: minimal (respectively maximal) time lags indeed specify that the time elapsed between two operations must be lower(respectively upper-) bounded. We assume that such constraints ...

The manufacturing processes of a chip resistor are very similar to a flowshop scheduling problem only with minor details which can be modeled using some extra constraints; while permutation flowshop scheduling problems (PFSPs) have attracted much attention in the research works. Many approaches like genetic algorithms were dedicated to solve PFSPs effectively and efficiently. In this paper, a n...

Flowshop scheduling is an interdisciplinary challenge of addressing major optimality criteria of minimizing makespan and total-flow-time. The enumerations for finding the probabilities for improving the utilization of resources turn this problem towards NP-Hard. Particle Swam Optimization (PSO) has proven its ability to find of near optimal solution when problem size is large. Local search tech...

In this paper, we consider a flowshop scheduling problem with sequence-dependent setup times and a bicriteria objective to minimize the work-in-process inventory for the producer and to maximize the customers’ service level. The use of a bicriteria objective is motivated by the fact that successful companies in today’s environment not only try to minimize their own cost but also try to fulfill ...

This paper deals with the heuristic solution of flexible flowshop scheduling problems with unrelated parallel machines. A setup time is necessary before starting the processing of a job, where the setup time depends on the previous job. No preemption of jobs is allowed. As objective function, this paper considers the minimization of the positively weighted convex sum of makespan and the number ...

Please cite this article in press as: Ciavotta, M., e prehensive study. European Journal of Operatio The permutation flowshop scheduling problem has been thoroughly studied in recent decades, both from single objective as well as frommulti-objective perspectives. To the best of our knowledge, little has been done regarding the multi-objective flowshop with Pareto approach when sequence dependen...