In this paper, we present an analysis of the strength of sparse cutting-planes for mixed integer linear programs (MILP) with sparse formulations. We examine three kinds of problems: packing problems, covering problems, and more general MILPs with the only assumption that the objective function is non-negative. Given a MILP instance of one of these three types, assume that we decide on the suppo...

This paper presents the fuzzy mixed-integer goal programming model for a single machine scheduling problem with bi-objectives consisting of the minimization of the total weighted flow time and total weighted tardiness. This model is solved by a fuzzy goal programming approach to verify and validate the proposed approach for the above problem. Two test problems in small and large sizes are gener...

In the paper, a general complex dynamical network with coupling lags is introduced. Then the problem of synchronization stability analysis for the complex dynamical network is further discussed. By use of linear matrix inequalities (LMI), a novel Lyapunov functional is constructed. And then we have obtained a new general stability criterion of synchronization state in the complex dynamical netw...

Covering problems are well-studied in the domain of Operations Research, and, more specifically, Location Science. When location space is a network, most frequent assumption to consider candidate facility locations, points be covered, or both, finite sets. In this work, we study set-covering problem when both locations and demand continuous on network. This variant has received little attention...

We present optimal solutions to the test scheduling problem for core-based systems. Given a set of tasks (test sets for the cores), a set of test resources (e.g., test buses, BIST hardware) and a test access architecture, we determine start times for the tasks such that the total test application time is minimized. We show that the test scheduling decision problem is equivalent to the -processo...

Single machine, distinct due dates, early/lately machine problem and fuzzy environment closely models the situation faced by ‘Just In Time’ manufacturing. The objective of this paper is to sequence the jobs on the machine, so that the total penalty cost be minimum. This cost is composed of the total earliness and the total tardiness cost. An algorithm is developed here to minimize the total pen...

In this paper, we present an analysis of the strength of sparse cutting-planes for mixed integer linear programs (MILP) with sparse formulations. We examine three kinds of problems: packing problems, covering problems, and more general MILPs with the only assumption that the objective function is non-negative. Given a MILP instance of one of these three types, assume that we decide on the suppo...

A novel algorithm for one machine scheduling to minimize total weighted earliness and tardiness using particle swarm optimization is proposed. Existing techniques face challenges such as job size limitations increase in computational time and inaccurate solutions. To overcome these challenges the proposed work implements Meta-Heuristic based particle swarm optimization to optimize the total wei...

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the setup ...