In this paper, we consider coordinated production and interstage batch delivery scheduling problems, where a third-party logistics provider (3PP) delivers semi-finished products in batches from one production location to another production location belonging to the same manufacturer. A batch...

We consider the the two-machine ow-shop serial-batching scheduling problem where the batches have limited size. Two criteria are considered here. The rst criterion is to minimize the number of batches. This criterion re ects situations where processing of any batch induces a xed cost, which...

It is now widely recognized that the increase of greenhouse gases in the atmosphere is due to the consumption of fossil fuels since the beginning of the 20th century. In this context, research on new energies and their development on a large scale is a priority. Hydrogen is a potential candidate...

Il blocco operatorio costituisce lo snodo centrale del percorso chirurgico. In un’ottica lean di revisione dei processi, la programmazione chirurgica deve mantenere allineato il servizio con la domanda. Di conseguenza, è necessario trovare il giusto compromesso tra l’esigenza di mantenere...

In this paper, we present two real-world situations in which the standard hypotheses of a bargaining problem do not hold, and discuss how to tackle these situations.

This research aims at supporting hospital management in making prompt Operating Room (OR) planning decisions, when either unpredicted events occur or alternative scenarios or configurations need to be rapidly evaluated. We design and test a planning tool enabling managers to efficiently analyse...

We consider the problem of scheduling n tasks subject to chain-precedence constraints on two identical machines with the objective of minimizing the makespan. The problem is known to be strongly NP-hard. Here, we prove that it is binary NP-hard even with three chains. Furthermore, we...

In this paper, we propose a tool for testing the quality of heuristic solutions for scheduling problems with a min-max objective function, such as, for example, the minimization of maximum tardiness or makespan. We present a bounding scheme which is powerful enough to allow an accurate quality...