We consider the problem of scheduling n jobs, each with a specific processing requirement, release time and due date on m uniform parallel machines. It is shown that a feasible schedule can be obtained by determining the maximum flow in a network, thus permitting the use of standard network flow codes. Using a specialized maximum flow procedure, the complexity reduces to O(tn3) operations when ...

Abstract This paper considers single-machine scheduling problems in which a given solution, i.e., an ordered set of jobs, has to be improved as much possible by re-sequencing the jobs. The need for rescheduling may arise different contexts, e.g., due changes job data or because local objective stage supply chain that is not aligned with sequence. A common production setting entails movement job...

This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizing maximal lateness Lmax for integer due dates to problem, where along precedence constraints given on set V={v1,v2, …,vn} of multiprocessor a subset tasks must be processed simultaneously. Contrary classical shop-scheduling several processors fulfill task. Furthermore, two types may task V. We p...

Keywords: Residence time distribution (RTD), moments of RTD, experimental estimation of RTD, RTD of ideal and nonideal flow models, axially dispersed plug flow model, tanks in series model, multiparameter model, dispersion coefficient, microfluid, macrofluid, earliness and lateness of mixing, conversion in nonideal flows.

The objective of this paper is to describe a control technique that can be use in a supply chain environment. A multi-product, multi-stage manufacturing system was built and simulation was used to analyse the system behaviour. System benefits were investigated based on the behaviour of the following performance measures: flow time, lateness, work in progress and production cost.

we consider a functional equation that arises in problems of scheduling with priorities and earliness/lateness penalties. We solve the equation and note how it can be used to analyze the invariance of conclusions about optimality of a schedule if the scale used to measure priority is replaced by another acceptable scale. Keywords-Scheduling, Functional equations, Measurement theory, Penalty fun...