Scheduling in a Single-stage, Multi-item Compatible Process using Multiple Arc Network with Gains Model
Sasidhar, Bokkasam . 2018
The problem of scheduling a given set of machines in a single-stage, multi-item compatible environment, with the objective of maximizing capacity utilization has been formulated [1] as a maximal flow problem in a Multiple Arc Network (MAN). The model is based on the quantities of inputs and outputs at the processing unit. Further, the inherent assumption of the model is that the input and output quantities are identical. In reality, while processing most of the products, they not only undergo transformation but also the output quantities or weights will differ. Hence the scheduling problem has been formulated as a maximal flow problem in a MAN with gains. The gain represents the factor which brings about change in quantity, such as yield. The model aims to provide optimal production schedule with an objective of maximizing capacity utilization, so that the customer-wise delivery schedules are fulfilled, keeping in view the customer priorities. Algorithms have been presented for solving the MAN formulation of the production planning with customer priorities as well as the gain factor. The suitability of the algorithms has been demonstrated with an example.
The importance of scheduling in the industrial world is growing rapidly. Customer-driven production scheduling is the need of the hour in the present business environment.
Fixed charge transportation problem (FCTP), which can be considered as a
distribution problem, is considered to be an NP-hard problem. One of its versions is the Step Fixed
charge…
Service quality is a competitive weapon in the banking industry. Better understanding of customer’s perception
of service quality in the banking industry and the drivers of such perceptions…