The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We study the problem of minimizing total completion time in 2-stage flowshop with availability constraint. This problem is NP-hard in the strong sense even if both machines are always available. With availability constraint, although a bulk of research papers have studied the makespan minimization problem, there is no research done on the total completion time minimization. This paper is the first...
We consider the problem of scheduling multi-task jobs on identical machines in parallel. Each multi-task job consists of one or more tasks. Each job has a release date and a due date. A task of a job can be processed by any one of the machines. Multiple machines can process the tasks of a job concurrently. The completion time of a job is the time at which all its individual tasks have been completed...
We study the problem of minimizing total completion time in the two-machine flow shop with exact delay model. This problem is a generalization of the no-wait flow shop problem which is known to be strongly NP-hard. Our problem has many applications but little results are given in the literature so far. We focus on permutation schedules. We first prove that some simple algorithms can be used to find...
We investigate the problems of scheduling n weighted jobs to m identical machines with availability constraints. We consider two different models of availability constraints: the preventive model where the unavailability is due to preventive machine maintenance, and the fixed job model where the unavailability is due to a priori assignment of some of the n jobs to certain machines at certain times...
This paper considers the coordinated production and delivery scheduling problem. We have a planning horizon consisting of z delivery times each with a unique delivery capacity. Suppose we have a set of jobs each with a committed delivery time, processing time, production window, and profit. The company can earn the profit if the job is produced in its production window and delivered before its committed...
The survivable network design problem is a classical problem in combinatorial optimization of constructing a minimum-cost subgraph satisfying predetermined connectivity requirements. In this paper we consider its geometric version in which the input is a complete Euclidean graph. We assume that each vertex v has been assigned a connectivity requirement rv. The output...
We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are resistant to edge or vertex removal. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-weighted...
We investigate the problems of scheduling n jobs to m = m1 + m2 identical machines where m1 machines are always available, m2 machines have some specified unavailable intervals. The objective is to minimize the makespan. We assume that if a job is interrupted by the unavailable interval, it can be resumed after the machine becomes available. We show...
This paper reports a collaborative research that evaluates the Microsoft PowerPoint (PPT) based visualization materials automatically generated by an innovative Computer Science educational research project. The approach of autogeneration of teaching materials has been designed to increase the accessibility to easy-to-use teaching slides and improve the engagement and the effectiveness of teaching...
Due to the limitation of energy, the router protocol of wireless sensor network (WSN) must minimize energy consumption to extend the network lifetime. By analyzing the hierarchical routing low energy adaptive clustering hierarchy (LEACH) in WSN, a protocol is proposed to improve of setting up cluster and data transmission route. A timer is introduced to make sure of electing the optimal sensor node...
Water quality assessment and prediction of Lake Michigan are becoming major challenges in Northwest Indiana. Traditionally, mechanistic simulation models are employed for water quality modeling and prediction. However, given the complicate nature of Lake Michigan in Northwestern Indiana, the detailed simulation model is extremely simple in comparison and, at some point, additional detail exceeds our...
In this paper, we consider the coupled-task scheduling problem, to schedule n jobs on a single machine. Each job consists of two coupled tasks which have to be processed in a predetermined order and at exactly a specified interval apart. The objective is to minimize the makespan. The problem was shown to be NP-hard in the strong sense even for some special cases. We analyze some heuristics with worst-case...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.