Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs

Article Abstract:

Local search heuristics were devised for a problem of scheduling jobs on a single machine. Jobs were classified into families and a set-up time was required when there was a change in processing jobs from one family to jobs of another family. The goal was to minimize late jobs. Multi-start descent, simulated annealing, tabu search and a genetic algorithm were the four alternative local search processes tested. The genetic algorithm provided the best results but multi-start descent also worked well.

Methods, Models, Scheduling (Management)

---

Scheduling for a multifunction phased array radar system

Article Abstract:

A functional simulation model is used to evaluate the performance of several scheduling heuristics developed for a multifunction phased array radar system designed by the Defense Research Agency. The study is confined in two major areas, namely the coupled-task scheduling problem and the on-line scheduling problem. Results indicate that the proposed model is very useful for evaluating the cyclic behavior of the heuristics.

Search, Detection, Navigation, Guidance, Aeronautical, and Nautical System and Instrument Manufacturing, Search and navigation equipment, Airborne & Marine Instrument Radar, Research, Radar, Radar systems, Instrumentation radar

---

Similar abstracts:

• Abstracts: A procedure for the one-machine sequencing problem with dependent jobs. Genetic algorithms to minimize the weighted number of late jobs on a single machine
• Abstracts: Order-based neighborhoods for project scheduling with nonregular objective functions. On linear lower bounds for the resonance constrained project scheduling problem
• Abstracts: Single machine scheduling subject to deadlines and resource dependent processing times. Single machine batch scheduling with jointly compressible setup and processing times
• Abstracts: Two-machine flow shop scheduling with two criteria: maximum earliness and makespan. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
• Abstracts: The dimension for the European Union Council under the nice rules. The distribution problem, the more for less (nothing) paradox and economies of scale and scope

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.