This paper focuses on the scheduling of trucks at a transshipment terminal with a single gate. Trucks deliver or pick up a single type of items at the gate and, therefore, increase or decrease, respectively, the inventory level. Naturally, pick up trucks can be served only if the required amount of items is available in the inventory. We consider the problem to find a schedule for trucks such t...

Operating rooms have become the most important areas in hospitals because of the scarcity and cost of resources. The present study investigates operating room scheduling and rescheduling considering the priority of surgical patients in a specialized hospital. The ultimate purpose of scheduling is to minimize patient waiting time, surgeon idle time between surgeries, and penalties for deviations...

In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...

Assembly plays an important role in any production system as it constitutes a significant portion of the lead time and cost of a product. Virtual computer-integrated manufacturing (VCIM) system is a modern production system being conceptually developed to extend the application of traditional computer-integrated manufacturing (CIM) system to global level. Assembly scheduling in VCIM systems is ...

different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. conventional productionmethods are constantly subs...

Due to the precedence constraints among vertices, the partitioning problem for dynamically reconfigurable FPGAs (DRFPGAs) is different from the traditional one. In this paper, we first derive logic formulations for the precedence-constrained partitioning problems, and then transform the formulations into integer linear programs (ILPs). The ILPs can handle the precedence constraints and minimize...

A lattice surgery protocol is introduced to optimize quantum computing, helping eliminate extra circuit components and gate scheduling complexities, or reduce runtimes the total space-time costs.

this paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. the fuzzy set theory is applied to describe this situation. a novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. due to the computational complexities, the prop...

in this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. we concern rework in the scheduling environment and propose a mixed-integer programming (mip) model for the problem.  based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...