An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
IEEE Transactions on Computers
Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers
Multiprocessor scheduling: combining LPT and MULTIFIT
Discrete Applied Mathematics
Scheduling independent two processor tasks on a uniform duo-processor system
Discrete Applied Mathematics - Combinatorial Optimization
Scheduling independent jobs on partitionable hypercubes
Journal of Parallel and Distributed Computing
Computers and Operations Research
Applying tabu search with influential diversification to multiprocessor scheduling
Computers and Operations Research - Special issue: heuristic, genetic and tabu search
Scheduling multiprocessor tasks in a two-stage flow-shop environment
Proceedings of the 21st international conference on Computers and industrial engineering
Scheduling flowshops with finite buffers and sequence-dependent setup times
Computers and Industrial Engineering
An Enhanced TSP-Based Heuristic for Makespan Minimizationin a Flow Shop with Setup Times
Journal of Heuristics
On Job Scheduling on a Hypercube
IEEE Transactions on Parallel and Distributed Systems
A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks
Journal of Scheduling
A discrete particle swarm optimization algorithm for scheduling parallel machines
Computers and Industrial Engineering
Expert Systems with Applications: An International Journal
A fast metaheuristic for scheduling independent tasks with multiple modes
Computers and Industrial Engineering
Minimizing makespan on identical parallel machines using neural networks
ICONIP'06 Proceedings of the 13th international conference on Neural information processing - Volume Part III
A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis
Operations Research Letters
Hi-index | 0.00 |
We consider an operations planning problem in a military aviation unit that performs a number of flight missions with multiple identical aircrafts. The problem is to assign the flight missions to the aircrafts and to schedule these assigned missions on each aircraft. Sequence-dependent setup times are required between the missions, and multiple aircrafts may be needed for a mission, but the aircrafts assigned to the same mission should start the mission simultaneously. We develop heuristic algorithms for the problem with the objective of minimizing makespan, i.e., the time by which all the missions have been completed. For evaluation of the performance of the algorithms, a series of computational tests was performed on a number of problem instances, and results show that the proposed algorithms give good or near optimal solutions in a reasonable amount of time.