Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 5 of 5
Full-Text Articles in Entire DC Network
Minimizing The Makespan In A Two-Stage Flowshop Scheduling Problem With A Function Constraint On Alternative Machines, Chou-Jung Hsu, Wen-Hung Kuo, Dar-Li Yang, Maw-Sheng Chern
Minimizing The Makespan In A Two-Stage Flowshop Scheduling Problem With A Function Constraint On Alternative Machines, Chou-Jung Hsu, Wen-Hung Kuo, Dar-Li Yang, Maw-Sheng Chern
Journal of Marine Science and Technology
In this paper, we consider a two-stage flowshop scheduling problem with a function constraint on alternative machines. The objective is to minimize the makespan. We show that the proposed problem is NP-hard and provide some heuristic algorithms and computational experiments. In addition, from the experimental results, the modification of Johnson’s rule combined with the First-Fit rule is the best heuristic algorithm of the proposed heuristic algorithms.
High Performance Queueing And Scheduling In Support Of Multicasting In Input-Queued Switches, Weiying Zhu
High Performance Queueing And Scheduling In Support Of Multicasting In Input-Queued Switches, Weiying Zhu
Electrical & Computer Engineering Theses & Dissertations
Due to its mild requirement on the bandwidth of switching fabric and internal memory, the input-queued architecture is a practical solution for today's very high-speed switches. One of the notoriously difficult problems in the design of input-queued switches with very high link rates is the high performance queueing and scheduling of multicast traffic. This dissertation focuses on proposing novel solutions for this problem. The design challenge stems from the nature of multicast traffic, i.e., a multicast packet typically has multiple destinations. On the one hand, this nature makes queueing and scheduling of multicast traffic much more difficult than that of …
Improving Intercontinental Ballistic Missile Maintenance Scheduling Through The Use Of Location Analysis Methodologies, Dale L. Overholts Ii
Improving Intercontinental Ballistic Missile Maintenance Scheduling Through The Use Of Location Analysis Methodologies, Dale L. Overholts Ii
Theses and Dissertations
The events of September 11, 2001 have led to increased security requirements for all ICBM-related activities. Missile maintenance managers must explore new scheduling techniques to sustain weapon system readiness levels in light of published security enhancements. The problem of improving missile maintenance scheduling is modeled as a two-stage heuristic that utilizes the maximal covering location problem methodology. Maintenance activities are categorized and weighted according to published priority designation and mission impact. The model’s first stage seeks to select two security umbrellas that maximize the weighted sum of maintenance activities. Stage two seeks to determine a maintenance schedule comprised of launch …
A Tabu Search Algorithm To Minimize The Makespan For The Unrelated Parallel Machines Scheduling Problem With Setup Times, Magdy Helal, Ghaith Rabadi, Ameer Al-Salem
A Tabu Search Algorithm To Minimize The Makespan For The Unrelated Parallel Machines Scheduling Problem With Setup Times, Magdy Helal, Ghaith Rabadi, Ameer Al-Salem
Engineering Management & Systems Engineering Faculty Publications
In this paper we propose a tabu search implementation to solve the unrelated parallel machines scheduling problem with sequence- and machine- dependent setup times to minimize the schedules makespan. The problem is NP-hard and finding an optimal solution efficiently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The proposed tabu search algorithm uses two phases of perturbation schemes: the intra-machine perturbation, which optimizes the sequence of jobs on the machines, and the inter-machine perturbation, which balances the assignment of the jobs to the machines. We compare the proposed algorithm to an existing one that addressed the …
A Robust Reactive Scheduling System With Application To Parallel Machine Scheduling, Jean-Paul M. Arnaout
A Robust Reactive Scheduling System With Application To Parallel Machine Scheduling, Jean-Paul M. Arnaout
Engineering Management & Systems Engineering Theses & Dissertations
In this turbulent world, scheduling role has become crucial in most manufacturing production, and service systems. It allows the allocation of limited resources to activities with the objective of optimizing one performance measure or more. Resources may be machines in a factory, operating rooms in a hospital, or employees in a company, while activities can be jobs in a manufacturing plant, surgeries in a hospital, or paper work in a company. The goal of each schedule is to optimize some performance measures, which could be the minimization of the schedule makespan, the jobs' completion times, jobs' earliness and tardiness, among …